Design and Analysis of Algorithm Question Set

ISBN-13: 9786200782014 / Angielski

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

Opis

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.

O autorze

Karmore, Bhavana S.
Dr. Bhavana S. Karmore is working as a Professor at Shrimati Narsamma Hirayya Shaikshanik Trust Arts, Commerce & Science College, Amravati for U. G. and P. G. Department. Years of experience 13+. She published more than 20+ papers in international journals. She worked as an international expert at International conferences.