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.
Product details
Publisher : CareerMonk Publications; Second edition (29 December 2011)
Language : English
Paperback : 449 pages
ISBN-10 : 0615459811
ISBN-13 : 978-0615459813
Item Weight : 1 kg 140 g
Dimensions : 21.59 x 2.57 x 27.94 cm
Country of Origin : United Kingdom
Best Sellers Rank: #263,272 in Books (See Top 100 in Books)
#147 in Java Programming
#175 in Algorithms
#223 in Programming Algorithms
Customer Reviews: 4.4
3,139 ratings