Design and Analysis of Algorithms
The focus of this book is on how to design good algorithms and how to analyze their efficiency. Various methods/ideas are explained with the help of examples which helps in developing fast and efficient algorithms. This book will also provide the correctness of algorithms and analyzing the algorithms. At the end of the chapters it chapters it has questions both solved and unsolved which has come in various Indian universities.
- Algorithm
- Analyzing & Design of Algorithm
- Asymptotic Growth of Function
- Recursion
- Hashing
- Quick sort
- Heap Sort
- Sorting In Linear Time
- Randomized Algorithm
- Elementary Data Structures
- Introduction To Tree
- Red-Black Tree
- AVL Tree
- B-Tree
- Binomial Tree
- Graph
- Graph Traversal
- Directed Acyclic Graphs
- Undirected Graphs
- Dynamic Programming
- Greedy Algorithm
- String Matching
- Disjoint-Set Data Structures
- Sorting Network
- Maximum Flow
- Amortized Analysis
- Approximate Algorithms
- NP-Completeness
- Matrix Operation
- Backtracting
- Model Questions
- End-Term Examination
Customer Feedback
No reviews yet. Be the first to review this product!
No other books found by the same author.