An edition of Design and Analysis of Algorithms
(2018)
Design and Analysis of Algorithms
for Engineering Studies, First Edition
by Krishna Sankar P and Shangaranarayanee N P
- 1 Want to read
Share
×Close
Last edited by Shangaranarayanee N P
October 27, 2018 | History
This book “Design and Analysis of Algorithms”, covering various algorithm and analyzing the real word problems. It delivers various types of algorithm and its problem solving techniques. It stretches an outline on analyzing the algorithm and identifying the efficiency based on the time and space complexity. It contributes an idea over analyzing the real world problems to representing the data of the problem and applying the next level algorithm to achieve the goal of the problem.
Check nearby libraries
Buy this book
| Edition | Availability |
|---|---|
1
Design and Analysis of Algorithms: for Engineering Studies, First Edition
November 2018, A.R. Publications, Chennai
Hardcover
in English
9387255131 9789387255135
|
aaaa
|
Book Details
Table of Contents
UNIT I
INTRODUCTION
1.1. Notion of an Algorithm
1.2. Fundamentals of Algorithmic Problem Solving
1.3. Important Problem Types
1.4. Fundamentals of the Analysis of Algorithmic Efficiency
1.5. Mathematical analysis
1.6. Empirical analysis
1.7. Visualization
UNIT II
BRUTE FORCE AND DIVIDE-AND-CONQUER
2.1 Brute Force
2.2 Closest-Pair and Convex-Hull Problems
2.3 Exhaustive Search
2.4 Divide and Conquer Methodology
2.5 Multiplication of Large Integers
2.6 Closest-Pair and Convex - Hull Problems
UNIT III
DYNAMIC PROGRAMMING AND GREEDY TECHNIQUE
3.1. Dynamic programming
3.2. Floyd‘salgorithm
3.3. Multi stage graph
3.4. Optimal Binary Search Trees
3.5. Knapsack Problem and Memory functions
3.6. Greedy Technique
3.7. Container loading problem
3.8. 0/1 Knapsack problem
3.9. Optimal Merge pattern
3.10. Huffman Trees
UNIT IV
ITERATIVE IMPROVEMENT
4.1 Simplex Method
4.2 Maximum-Flow Problem
4.3 Maximum Matching in Bipartite Graphs
4.4 Stable marriage Problem
UNIT V
COPING WITH THE LIMITATIONS OF ALGORITHM POWER
5.1. Lower - Bound Arguments
5.2. P, NP NP- Complete and NP Hard Problems
5.3. Backtracking
5.4. Branch and Bound
5.5. Approximation Algorithms for NP-Hard Problems
Edition Notes
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?
| October 27, 2018 | Edited by Shangaranarayanee N P | Edited without comment. |
| October 27, 2018 | Edited by Shangaranarayanee N P | Edited without comment. |
| October 27, 2018 | Edited by Shangaranarayanee N P | Edited without comment. |
| October 27, 2018 | Created by Shangaranarayanee N P | Added new book. |