Design and Analysis of Algorithms

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. Greedy Algorithm Graph Algorithms Back Tracking String Matching NP-Completeness NP-Complete Problems (with proofs) Approximation Algorithms. 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.. ABOUT THE AUTHORS: S.R.Jena : Soumya Ranjan Jena is working as an Assistant Professor in the department of Computer Science and Engineering at K L E F (Koneru Lakshmaiah Education Foundation) Deemed to be University Guntur Andhra Pradesh India. He has awarded M.Tech in IT B.Tech in CSE and CCNA. He has got immense experience in teaching to graduate as well as post-graduate students. He is the author of the book Theory of Computation and Application published by University Science Press an imprint of Laxmi Publications (P) Ltd New Delhi. . S.Patro : Satyabrata Patro is working as an Assistant Professor in the department of Computer Science and Engineering at K L E F (Koneru Lakshmaiah Education Foundation) Deemed to be University Guntur Andhra Pradesh India. He has obtained M.Tech in CSE MCA and M.Sc (Mathematics). He has 12 years of teaching experience at UG and PG level.