Design & Analysis of Algorithms
This book is intended for B. Tech (CS/IT), MCA and M. Tech students who want to have the basic to advanced knowledge of the design and analysis of algorithms. This book discusses various features of Algorithm design. In this 3rd edition more algorithms are added, papers of last few years are solved in chapters; few algorithms which were difficult to understand in previous edition are presented in easier form.
- Introduction
- Growth of Functions
- Summations
- Recurrences
- Sets Relations and Functions
- Probability
- Heaps and Heapsort
- Quicksort
- Sorting in Linear Time
- Medians and Order Statistics
- Elementary Data Structures
- Hashing
- BS Trees
- Optimal Binary Search Trees
- AVL Trees And Splaying
- RB-Trees
- Augmenting Data Structure
- Dynamic Programming
- Greedy Algorithms
- Amortized Analysis
- B. Trees-External Searching
- Binomial Trees and Binomial Heaps
- Fibonacci Heaps
- Data Structure for Disjoint Sets
- Elementary Graph Algorithms
- Back Tracking
- Branch and Bound
- Minimum Spanning Tree
- Single-Source Shortest Paths
- All Pair Shortest Paths
- Network Flow
- Sorting Networks
- Arithmetic Circuits
- Algorithms for Parallel Computers
- Matrix Operation
- Polynomials and FFT
- Number-Theoretic Algorithms
- String Matching
- Computational Geometry
- NP-Completeness
- Non-Deterministic Algorithms
- Approximation Algorithms
- Program
- Exam Papers
- Bibliography
Customer Feedback
No reviews yet. Be the first to review this product!
No other books found by the same author.