The book is designed to serve as a textbook for one semester course of the undergraduate students of Computer Science & Engineering and Information Technology as well as postgraduate students of Computer Applications of Rajiv Gandhi Proudyogiki Vishwavidyalaya. This highly structured and well-organized text provides the design techniques of algorithms in a simple and straightforward manner. It describes the complete development of various algorithms along with their self-explanatory pseudocodes supported by worked-out examples in order to have better understanding of algorithms.

Contents: 1. Introduction to Algorithms. 2. Divide and conquer. 3. Greedy Algorithms. 4. Dynamic programming. 5 Backtracking. 6. Branch and bound. 7. Tree. 8. Graph. 9. NP Completeness. Summary. Index.