Salient Features:1. Complete and Focused Coverage of Syllabus in Very Simple Language.2. Expanded Coverage of Sorting Algorithms in Chapter-4.3. Expanded Coverage of NP-Completeness and Approximation Algorithms in Chapter-17.4. More than 250 solved Examples.5. A Quick Reference Table for Time Complexity of Algorithms in Apendix-II.6. Last 3 Years Solved University Question Papers in Appendix-III.7. Chapter-wise Short Type Questions with Answers in Appendix-IV.8. Solved GATE Question Papers in Appendix-V.
