Design and Analysis of Algorithm Question Set

Bhavana S. Karmore

ISBN 10: 6200782016 / ISBN 13: 9786200782014

Published by LAP LAMBERT Academic Publishing Feb 2020, 2020

About this Item

This item is printed on demand - it takes 3-4 days longer - Neuware -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. 84 pp. Englisch.

Seller Inventory # 9786200782014

Bibliographic Details

• Title: Design and Analysis of Algorithm Question Set
• Publisher: LAP LAMBERT Academic Publishing Feb 2020
• Publication Date: 2020
• Language: English
• ISBN 10: 6200782016
• ISBN 13: 9786200782014
• Binding: Taschenbuch
• Condition: Neu

About this title

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.