Design And Analysis Of Algorithm Question Set

<p>Book contain Concept of Notion of an Algorithm - Fundamentals of Algorithmic Problem Solving - Important Problem Types<br/>- 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 - Floyds algorithm - Multi stage graph - Optimal Binary Search Trees - Knapsack Problem and Memory functions.<br/>Greedy Technique - Container loading problem - Prims algorithm and Kruskals Algorithm - 0/1 Knapsack problem Optimal Merge pattern - Huffman Trees.</p>