Description
Written by Narasimha Karumanchi, the book is an effective solution for complex data structures and algorithms. It contains various data structures and algorithm-related complex problems with appropriate solutions that are useful for readers studying computer science.
The book contains around 21 chapters that include various topics such as Stacks Queues, Recursion and Backtracking, Linked Lists, Priority Queue and Heaps, Sorting, Symbol Tables, Disjoint Sets ADT, Graph Algorithms, Searching, Hashing, Selection Algorithms (Medians), String Algorithms, Complexity Classes, Algorithms Design Techniques, Dynamic Programming, Greedy Algorithms, Divide and Conquer Algorithms and other Miscellaneous Concepts.
Coded in C/C++ language, the book serves as a useful guide to prepare for competitive examinations, interviews or for regular campus preparation. The data structures can improve the reader’s thinking power and capability of finding correct solutions. Moreover, enumerations for possible solutions are also given along with every problem.
It covers all topics that might be included in competitive examinations, so the reader can rely on this easy-to-understand book for their preparation. Besides competitive exams, the book can also serve as a guide to prepare for interviews as it includes all several interview questions based on data structure and algorithms.
Overall, it is a smart reference manual for both students and working people. It is complied in a way that readers can cover more topics in less time; hence revision would be quite easier with better understanding.
About the Author:
Narasimha Karumanchi has worked with IBM Labs, Mentor Graphics, Microsoft and Amazon. He has ample experience in software development, particularly algorithms and data structures. Born in Guntur andhra Pradesh, Narasimha Karumanchi did his B. Tech from JNT University and M. Tech from IIT Bombay.
