Data Structures and Algorithms Made Easy by Narasimha Karumanchi

Data Structures and Algorithms Made Easy by Narasimha Karumanchi

Data Structures And Algorithms Made Easy: Data Structures and Algorithmic Puzzlesis a book that offers solutions to complex data structures and algorithms. There are multiple solutions for each problem and the book is coded in C/C++, it comes handy as an interview and exam guide for computer scientists. It can be used as a reference manual by those readers in the computer science industry. This book serves as guide to prepare for interviews, exams, and campus work. In short, this book offers solutions to various complex data structures and algorithmic problems.

Topics Covered:

1. Introduction
2. Recursion and Backtracking
3. Linked Lists
4. Stacks
5. Queues
6. Trees
7. Priority Queue and Heaps
8. Disjoint Sets ADT
9. Graph Algorithms
10. Sorting
11. Searching
12. Selection Algorithms Medians]
13. Symbol Tables
14. Hashing
15. String Algorithms
16. Algorithms Design Techniques
17. Greedy Algorithms
18. Divide and Conquer Algorithms
19. Dynamic Programming
20. Complexity Classes
21. Miscellaneous Concepts

Narasimha Karumanchi founded CareerMonk Publishing and is the author of a number of books on data structures, algorithms, and design patterns. Over the course of his long career, he has been both an interviewer and an interviewee. He has worked at Amazon, IBM Software Labs, Mentor Graphics, and Microsoft in the past. Narasimha has a master's degree in technology. B.Tech. in computer science from IIT Bombay.

JNT University is a Japanese university. He wrote books in Chinese, Japanese, Korean, and Taiwanese, which were all translated into other languages. In addition, these volumes were used as a reference for academic courses by roughly 58 worldwide universities.