A Textbook of Data Structures and Algorithms, Volume 3: Mastering Advanced Data Structures and Algorithm Design Strategies (Computer Engineering Series)

Hardcover, xvii + 324 pages, NOT ex-library. Book is clean and bright with unmarked text, free of inscriptions and stamps, firmly bound. Creases to lower outer corners (bumped). Issued without a dust jacket. -- This is the concluding installment of a three-volume series by G.A. Vijayalakshmi Pai designed to take learners from novice to expert. This volume focuses on advanced data organization and high-level algorithm design strategies. The book explains concepts, techniques, and applications without tying them to a specific programming language. This approach prevents students from being distracted by complex syntax while trying to grasp fundamental algorithmic logic. It includes 181 illustrative problems, 276 review questions, and 108 suggested programming assignments to bridge the gap between theory and implementation. The book's chapters cover complex structures and competitive algorithm methodologies, providing a detailed coverage of Hash Tables, File Organizations, k-d Trees, and Treaps; sorting and searching (analysis of both Internal and External Sorting techniques, as well as advanced searching algorithms); design strategies (in-depth exploration of major algorithmic paradigms, including Divide and Conquer, Greedy Methods, and Dynamic Programming); and computational theory (an introduction to the P and NP Class of Problems, helping students understand the limits of efficient computation). G.A. Vijayalakshmi Pai is a Professor of Computer Applications at PSG College of Technology in India. Her research expertise lies in Computational Finance and Computational Intelligence, which informs the rigorous and pragmatic structure of this series.