Product Overview
PeelingData Structures and Algorithms[re-printed on 19-August-2016]:
Table of Contents: goo.gl/hMYJGq
Sample Chapter: goo.gl/DqVs8p
Source Code:goo.gl/e3imfV
Videos:goo.gl/BcHq74
A handy guide of sorts for any computer science professional,Data Structures And Algorithms Made Easy in Java: Data Structure And Algorithmic Puzzlesis 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. Wetook the direct route andsolved problemsofvarying complexities. That is, each problem corresponds to multiple solutions withdifferent complexities. In other words, we ennumerated possible solutions. With this approach, evenwhen anew question arises,weoffer a choice ofdifferent solution strategies based onyour 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
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 theblog at: CareerMonk.com
Also, check out sample chapters and theblog at: CareerMonk.com
