Data Structures And Algorithms Made Easy is a guide on the use Of data structures and algorithms.
Summary Of The Book
Data Structure refers to storing and organizing data in a system that would enable it to be used efficiently in the future. Different tasks require different forms of data structures. Therefore, each data structure is specific to the type of application it pertains to. Algorithms are an integral component in the processing of data by computer systems. Algorithms lay down the detailed and specific instructions need to be followed by computers in order to be able to perform a particular job.
The contents of Data Structures And Algorithms Made Easy include an Introduction to Data Structures, Backtracking, Recursion, Linked Lists, Queues, Stacks, Trees, Heaps, Priority Queues, and Disjoint Sets. Sorting, Graph Algorithms, Searching, Symbol Tables, Selection Algorithms, String Algorithms, Hashing, and Greedy Algorithms are also presented in the book. Techniques for designing Algorithms, Dynamic Programming, Divide & Conquer Algorithm, and Complexity Classes are some of the other concepts discussed.
The book is different in the sense that it does not aim at teaching proofs and theory only. Moreover, the USP of the book is that it has multiple solutions for a single problem. The solutions range from easy to difficult and have different complexity levels. The book is quite good for preparing for interviews, campus placements and for competitions. It helps one become confident enough to be able to challenge the interviewer, which is precisely what the objective of the book is. Also, it assists professors deliver improved lectures, which would make his students appreciate him for sure. The book focusses more in helping a student analyze problems better rather than memorise just theory.
There are over 700 algorithmic problems with solutions in this book. The book is quite easy to comprehend and contains information on job interviews for companies like Mcafee, Facebook, Oracle, Google, Yahoo, Amazon, Adobe, Microsoft, Flipkart, Success Factors, IBM Labs, NetApp etc.
About Narasimha Karumanchi
A founding member of CareerMonk, Narasimha Karumanchi has written quite a few books on algorithms and data structures.
Other books by the author include Data Structures And Algorithms Made Easy In Java, Coding Interview Questions, and Peeling Design Patterns: For Beginners & Interviews.
Karumanchi did his B. Tech from JNT University and M.Tech In Computers from Indian Institute of Technology, Mumbai. He has worked in the field of technology development for Amazon Corporation. Karumanchi has also worked at IBM Labs in Hyderabad, Microsoft, and at Mentor Graphics.
Certified Buyer, Nagpur
A treatise of intriguing problems on data structures
The book that stops your search for a good book for Data Structures
Certified Buyer, Durgapur
Good problem solving
A good resource for arithmetic tricks
Written in very simple English and easy to understand for students
Really useful for people like me.
Krishna Kumar A
Useful for both novice and professionals preparing for tech interviews
Way to Go!
It is a like Virtual Teacher for me