Book Details:
• Author: Nitin Upadhyay
• Publisher: S.K. Kataria & Sons
• Edition: Reprint 2013
• Language: English
• Number of Pages: 500
• Binding: Paperback
• Release Date: 01 January 2013
• ISBN: 9788189757939

About the Book:
This book is a comprehensive guide to algorithms and advanced data structures, specially designed for computer science and information technology students. Written by Nitin Upadhyay, the book explains algorithm design techniques, complexity analysis, and computational problem-solving methods in a clear and systematic manner.

The book covers important topics including algorithm analysis, growth of functions, control structures, recurrences, quick sort, elementary data structures, amortized analysis, heaps, sorting techniques, median and order statistics, searching and advanced search trees, dynamic programming, greedy algorithms, backtracking, branch and bound, graph algorithms, string matching, augmenting data structures, NP-completeness, polynomials and FFT, randomized algorithms, and algebraic computation. It also includes appendices, previous years’ question papers, and index for academic preparation and technical learning.

With well-organized chapters and easy-to-understand explanations, this book serves as an excellent academic and reference resource for university studies, programming practice, technical learning, and competitive examinations related to algorithms and data structures.