Data Structures and Algorithms Made Easy: Data Structure and Algorithmic Puzzles

Softcover

ISBN 10: 0615459811 ISBN 13: 9780615459813

Publisher: CareerMonk Publications, 2011

"Data Structures And Algorithms Made Easy: Data Structure And Algorithmic Puzzles" is 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. A handy guide of sorts for any computer science professional, Data Structures And Algorithms Made Easy: Data Structure And Algorithmic Puzzles is a solution bank for various complex problems related to data structures and algorithms. It can be used as a reference manual by those readers in the computer science industry. The book has around 21 chapters and covers Recursion and Backtracking, Linked Lists, Stacks, Queues,Trees, Priority Queue and Heaps, Disjoint Sets ADT, Graph Algorithms, Sorting, Searching, Selection Algorithms [Medians], Symbol Tables, Hashing, String Algorithms, Algorithms Design Techniques, Greedy Algorithms, Divide and Conquer Algorithms, Dynamic Programming, Complexity Classes, and other Miscellaneous Concepts. Data Structures And Algorithms Made Easy: Data Structure And Algorithmic Puzzles by Narasimha Karumanchi was published in March, and it is coded in C/C++ language. This book serves as guide to prepare for interviews, exams, and campus work. It is also available in Java. In short, this book offers solutions to various complex data structures and algorithmic problems. Peeling Data Structures and Algorithms for (C/C++, Second Edition): Programming puzzles for interviews Campus Preparation Degree/Masters Course Preparation Instructor's Big job hunters: Microsoft, Google, Apple, Amazon, Yahoo, Flip Kart, Adobe, IBM Labs, Citrix, Mentor Graphics, NetApp, Oracle, Face book, McAfee and many more Reference Manual for working people What is unique? Our main objective isn't to propose theorems and proofs about DS and Algorithms. We took the direct route and solved problems of varying complexities. That is, each problem corresponds to multiple solutions with different complexities. In other words, we enumerated possible solutions. With this approach, even when a new question arises, we offer a choice of different solution strategies based on your priorities. Topics Covered: Introduction Recursion and Backtracking Linked Lists Stacks Queues Trees Priority Queue and Heaps Disjoint Sets ADT Graph Algorithms Sorting Searching Selection Algorithms [Medians] Symbol Tables Hashing String Algorithms Algorithms Design Techniques Greedy Algorithms Divide and Conquer Algorithms Dynamic Programming Complexity Classes Miscellaneous Concepts Target Audience? These books prepare readers for interviews, exams, and campus work. Language? All code was written in C/C++. If you are using Java, please search for "Data Structures and Algorithms Made Easy in Java" (ISBN: 978-1468101270). Also, check out sample chapters and the blog at: CareerMonk.com

From the Author:

Objective of this book is to present the ideas for solving data-structure and algorithmic problems. I request to go through the first chapter as it describes when do we (situations) get different complexities like O(logn), O(n^2), O(loglogn), O(nlogn), O(2^n) etc.. Once you understand them, remaining chapters looks easy as we refer these complexities at every place.

About the Author:

Narasimha Karumanchi works at Amazon Corporation, India and is a senior software developer by profession. He has earlier worked for IBM labs, Mentor Graphics, and Microsoft.
He has founded CareerMonk, and is regular contributor to StockMonks, where he designs algorithms. He also submitted patents (still under progress). 
He authored the following books (few of these got translated to international languages: Chinese, Japanese, Korea and Taiwan).
   Data Structures and Algorithms Made Easy   Data Structures and Algorithms Made Easy in Java   Data Structures and Algorithms Made Easy for GATE   Peeling Design Patterns   Coding Interview Questions   IT Interview Questions   Data Structure and Algorithmic Thinking with Python   Elements of Computer Networking
Narasimha did his M.Tech. in computer science from IIT, Bombay, after finishing his B.Tech. from JNT university. He has also taught data structures and algorithms at various training institutes and colleges.