An edition of Design Analysis and Algorithms
(2008)
Design Analysis and Algorithms
Analysis of algorithm, Advanced Data Structure, Algorithm Analysis
by Hari Mohan Pandey
- 28 Want to read
- 2 Currently reading
- 3 Have read
Share
×Close
mplement the algorithms. This book provides comprehensive and completely up-to-date coverage of ?Design and Analysis of Algorithms?. It meets student?s needs by addressing both the designing principle as well as the critical role of performance in driving the algorithm. This book covers the syllabus of all the universities which offer the B.E./B.Tech (Computer Science & Engg./ Information Technology), B.Sc. (Computer Science/ Information Technology), and M.Sc. (Computer Science/ Information Technology) and it is also useful for MCA students. This has been written in a very simple and lucid language.
Salient Features of the BookEasily understandable, step by step description of each algorithm.
Plenty of illustrations supporting the theoretical concepts.
Large number of solved problems for real situation applications.
A simple formal descriptive language used throughout the book.
Step by step description of Red Black Tree (insertion and deletion).
Effective description of Sorting (Quick Sort, Heap Sort, Counting Sort etc.)
A simple description of Graphs Algorithms.
Numerous unsolved problems for practice in each chapter.
Check nearby libraries
Buy this book
| Edition | Availability |
|---|---|
1
Design Analysis and Algorithms: Analysis of algorithm, Advanced Data Structure, Algorithm Analysis
2008, University Science Press
Paperback
8131803341 9788131803349
|
aaaa
|
Book Details
Table of Contents
Chapter 1 :Introduction
Chapter 2 :Growth of Functions
Chapter 3 :Recurrences : Master's Theorem
Chapter 4 :Sorting and Sorting Methods : Heap Sort
Chapter 5 :Quick Sort
Chapter 6 :Divide and Conquer Methods
Chapter 7 :Sorting in Linear Time
Chapter 8 :Medians and Order Statistics
Chapter 9 :Red-Black Trees
Chapter 10; :Augmenting Data Structures
Chapter 11; :B-Trees
Chapter 12; :Binomial Heaps
Chapter 13; :Fibonacci Heaps
Chapter 14; :Data Structure for Disjoint Sets
Chapter 15; :Dynamic Programming
Chapter 16; :Greedy Algorithms
Chapter 17; :Amortized Analysis
Chapter 18; :Back-Tracking
Chapter 19; :Branch and Bound Technique
Chapter 20; :Introduction to Assignment Problem
Chapter 21; :String Matching : Pattern Matching Algorithm
Chapter 22; :Elmentary Graph Algorithms
Chapter 23; :Minimum Spanning Tree
Chapter 24; :Single Source Shortest Path Algorithm
Chapter 25; :All Pairs Shortest Paths Algorithm
Chapter 26; :Maximum Flow
Chapter 27; :Randomized Algorithms
Chapter 28; :NP-Completeness
Chapter 29; :Approximation Algorithm
Appendix
Questions for Review
Index
Edition Notes
The Physical Object
Edition Identifiers
Work Identifiers
Community Reviews (0)
Lists
See All
History
- Created March 7, 2011
- 5 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
| October 28, 2022 | Edited by ImportBot | import existing book |
| August 22, 2020 | Edited by ISBNbot2 | normalize ISBN |
| March 7, 2011 | Edited by 124.124.111.33 | Edited without comment. |
| March 7, 2011 | Edited by 124.124.111.33 | Added new cover |
| March 7, 2011 | Created by 124.124.111.33 | Added new book. |