Analysis and Design of Algorithms- A Beginner's Hope

The book has been written in such a way that the concepts and working of algorithms are explained in detail, with adequate examples. To make clarity on the topic, diagrams, calculation of complexity, algorithms are given extensively throughout. Many examples are provided which are helpful in understanding the algorithms by various strategies. This content is user-focused and has been highly updated including algorithms and their real-world examples.

Key features

This book is especially designed for beginners, and explains all aspects of algorithm and its analysis in a simple and systematic manner.
Algorithms and their working are explained in detail with the help of several illustrative examples.
Important features like greedy algorithm, dynamic algorithm, string matching algorithm, branch and bound algorithm, NP hard and NP complete problems are suitably highlighted.
Solved and frequently asked questions in the various competitive examinations, sample papers of the past examinations are provided which will serve as a useful reference source.
The book would serve as an extremely useful text for BCA, MCA, M. Sc. (Computer Science), PGDCA, BE (Information Technology) and B. Tech. and M. Tech. students.
Contents

Algorithm & Algorithmic Strategy
Complexity of Algorithms
Divide-and-Conquer Algorithms
Greedy Algorithm
Dynamic Programming
Graph Theory
Backtracking Algorithms
Branch and Bound Algorithms
String-Matching Algorithms
P and NP Problems