Design Analysis and Algorithms
Subtitle: Analysis of algorithm, Advanced Data Structure, Algorithm Analysis
Publisher: University Science Press
Published: 2008
Place of publication: New Delhi, India
Format: Paperback
Number of pages: 560
ISBN-13: 9788131803349
Description: 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.
Table of contents: title: Chapter 1    :Introduction; title: Chapter 2    :Growth of Functions; title: Chapter 3    :Recurrences : Master's Theorem; title: Chapter 4    :Sorting and Sorting Methods : Heap Sort; title: Chapter 5    :Quick Sort; title: Chapter 6    :Divide and Conquer Methods; title: Chapter 7    :Sorting in Linear Time; title: Chapter 8    :Medians and Order Statistics; title: Chapter 9    :Red-Black Trees; title: Chapter 10;  :Augmenting Data Structures; title: Chapter 11;  :B-Trees; title: Chapter 12;  :Binomial Heaps; title: Chapter 13;  :Fibonacci Heaps; title: Chapter 14;  :Data Structure for Disjoint Sets; title: Chapter 15;  :Dynamic Programming; title: Chapter 16;  :Greedy Algorithms; title: Chapter 17;  :Amortized Analysis; title: Chapter 18;  :Back-Tracking; title: Chapter 19;  :Branch and Bound Technique; title: Chapter 20;  :Introduction to Assignment Problem; title: Chapter 21;  :String Matching : Pattern Matching Algorithm; title: Chapter 22;  :Elmentary Graph Algorithms; title: Chapter 23;  :Minimum Spanning Tree; title: Chapter 24;  :Single Source Shortest Path Algorithm; title: Chapter 25;  :All Pairs Shortest Paths Algorithm; title: Chapter 26;  :Maximum Flow; title: Chapter 27;  :Randomized Algorithms; title: Chapter 28;  :NP-Completeness; title: Chapter 29;  :Approximation Algorithm; title: Appendix; title: Questions for Review; title: Index