3 Review(s)

This book is intended for the students of B.Tech & BE (CSE/IT), M.Tech & ME (CSE/IT), MCA, M.Sc (CS/IT). This book includes: Fundamental Concepts on Algorithms Framework for Algorithm Analysis Asymptotic Notations Sorting Algorithms Recurrences Divide and Conquer Approach Dynamic Programming Approach Salient Features: Complete and Focused Coverage of Syllabus in Very Simple Language. Expanded Coverage on Sorting Algorithms in Chapter-4. Expanded Coverage on NP-Completeness and Approximation Algorithms in Chapter-17. More than 250 Solved Examples. A Quick Reference Table for Time Complexity of Algorithms in Appendix-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.