Design and Analysis of Algorithms

Complete and Focused Coverage of Syllabus in Very Simple Language.

Expanded Coverage of Sorting Algorithms in Chapter-4.

Expanded Coverage of NP-Completeness and Approximation Algorithms in Chapter-17.

More than 250 solved Examples.

A Quick Reference Table for Time Complexity of Algorithms in Apendix-II.

Last 3 Years Solved University Question Papers in Appendix-III.

Chapter-wise Short Type Questions with Answers in Appendix-IV.

Solved GATE Question Papers in Appendix-V.