Data Structures and Algorithms Made Easy in Java: Data Structure and Algorithmic Puzzles, Second Edition - Softcover

Karumanchi, Narasimha

Softcover

ISBN 10: 1468101277 ISBN 13: 9781468101270

Publisher: CreateSpace Independent Publishing Platform, 2011

Synopsis

Table of Contents: goo.gl/hMYJGq Sample Chapter: goo.gl/DqVs8p Source Code: goo.gl/e3imfV
Peeling Data Structures and Algorithms Made Easy In Java: Data Structure and Algorithmic Puzzles
A handy guide of sorts for any computer science professional, Data Structures And Algorithms Made Easy in Java: 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 in Java: Data Structure And Algorithmic Puzzles by Narasimha Karumanchi was published in 2011, and it is coded in Java language. This book serves as guide to prepare for interviews, exams, and campus work. It is also available in C/C++. In short, this book offers solutions to various complex data structures and algorithmic problems.
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 ennumerated 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 Java. If you are using C/C++, please search for "Data Structures and Algorithms Made Easy". Note: If you already have "Data Structures and Algorithms Made Easy" no need to buy this.

Also, check out sample chapters and the blog at: CareerMonk.com                  

About this title

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. Karumanchi 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.

About this edition

• Publisher: CreateSpace Independent Publishing Platform
• Publication date: 2011
• ISBN 10: 1468101277
• ISBN 13: 9781468101270
• Binding: Paperback
• Edition number: 2
• Number of pages: 412