Design and Analysis of Algorithm Question Set - Couverture souple

Karmore, Bhavana S.; Barbudhe, Vishwajit K.; Zanjat, Shraddha N.

 
9786200782014: Design and Analysis of Algorithm Question Set

Synopsis

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.