Design and Analysis of Algorithms
Subtitle: for Engineering Studies, First Edition
Publisher: A.R. Publications, Chennai
Published: November 2018
Place of publication: Chennai, India
Language: eng
Format: Hardcover
Number of pages: 350
ISBN-13: 9789387255135
Table of contents: title: UNIT I; title: INTRODUCTION; title: 1.1. Notion of an Algorithm; title: 1.2. Fundamentals of Algorithmic Problem Solving; title: 1.3. Important Problem Types; title: 1.4. Fundamentals of the Analysis of Algorithmic Efficiency; title: 1.5. Mathematical analysis; title: 1.6. Empirical analysis; title: 1.7. Visualization; title: UNIT II; title: BRUTE FORCE AND DIVIDE-AND-CONQUER; title: 2.1 Brute Force; title: 2.2 Closest-Pair and Convex-Hull Problems; title: 2.3 Exhaustive Search; title: 2.4 Divide and Conquer Methodology; title: 2.5 Multiplication of Large Integers; title: 2.6 Closest-Pair and Convex - Hull Problems; title: UNIT III; title: DYNAMIC PROGRAMMING AND GREEDY TECHNIQUE; title: 3.1. Dynamic programming; title: 3.2. Floyd‘salgorithm; title: 3.3. Multi stage graph; title: 3.4. Optimal Binary Search Trees; title: 3.5. Knapsack Problem and Memory functions; title: 3.6. Greedy Technique; title: 3.7. Container loading problem; title: 3.8. 0/1 Knapsack problem; title: 3.9. Optimal Merge pattern; title: 3.10. Huffman Trees; title: UNIT IV; title: ITERATIVE IMPROVEMENT; title: 4.1 Simplex Method; title: 4.2 Maximum-Flow Problem; title: 4.3 Maximum Matching in Bipartite Graphs; title: 4.4 Stable marriage Problem; title: UNIT V; title: COPING WITH THE LIMITATIONS OF ALGORITHM POWER; title: 5.1. Lower - Bound Arguments; title: 5.2. P, NP NP- Complete and NP Hard Problems; title: 5.3. Backtracking; title: 5.4. Branch and Bound; title: 5.5. Approximation Algorithms for NP-Hard Problems