Book Details

• Publisher: S.K. Kataria & Sons

• Author: Vinod K. Rajput

• Language: English

• Edition: Reprint 2013

• ISBN: 9789350140918

• Pages: 650

• Cover: Paperback

• Dimensions: 9.4 x 7.2 x 1.0 inches

About the Book

This English paperback book by Vinod K. Rajput is a comprehensive academic resource for students studying data structures, algorithms, algorithm analysis, and computer science fundamentals. The book covers a wide range of important topics such as growth of functions, recurrence, sorting algorithms, divide and conquer, heapsort, quicksort, sorting in linear time, median and order statistics, hash tables, binary search trees, AVL trees, red-black trees, augmenting data structures, dynamic programming, greedy algorithms, amortized analysis, B-trees and B+ trees, binomial heaps, Fibonacci heaps, disjoint sets, backtracking, branch and bound, elementary graph algorithms, minimum spanning trees, single-source shortest paths, all-pairs shortest paths, minimum flow, sorting networks, matrix operations, polynomials and FFT, number theoretic algorithms, string matching, NP-completeness, and approximation algorithms. It also includes previous years’ question papers, bibliography, and an index, making it helpful for classroom learning, self-study, revision, coding practice, and examination preparation. With its detailed 650-page coverage and exam-oriented approach, this book is suitable for computer science, information technology, engineering, MCA, BCA, diploma, and technical course students looking for a reliable reference on algorithms and data structures.