Design and Analysis of Algorithm Question Set

The book contains: Concept of Notion of an Algorithm - Fundamentals of Algorithmic Problem Solving - Important Problem Types - Fundamentals of the Analysis of Algorithmic Efficiency - Asymptotic Notations and their properties. Analysis Framework - Empirical analysis - Mathematical analysis for Recursive and Non-recursive algorithms - Visualization. Dynamic programming - Principle of optimality - Coin changing problem, Computing a Binomial Coefficient - Floyd's algorithm - Multi stage graph - Optimal Binary Search Trees - Knapsack Problem and Memory functions.Greedy Technique - Container loading problem - Prim's algorithm and Kruskal's Algorithm - 0/1 Knapsack problem, Optimal Merge pattern - Huffman Trees.

Autorentext

Dr. Bhavana S. Karmore is working as Assistant Professor and Head of Department at BCA and MCA Department of G. H. Raisoni University, Amravati, for U. G. and P. G. Department. Total years of experience 15+. She published more than 20 papers in international journals. She works as International Expert at international conferences.