Skip to content
Data Structure And Algorithms Made Easy In Java
Branch: master
Clone or download
careermonk Merge pull request #13 from itsmohitgoel/fix_dll_implementation
fix: add condition for moving pointer to next nodes.
Latest commit 7f03c0c Apr 2, 2019

README.md

Data Structure And Algorithms Made Easy In Java

Copyright (c) Dec 21, 2014 CareerMonk Publications and others.

E-Mail : info@careermonk.com

Last modification by : Narasimha Karumanchi

Book Title : Data Structures And Algorithms Made Easy In Java

ISBN : 9781466304161 [For India]/9781468101270 [Except India]

Warranty : This software is provided "as is" without any warranty; without even the implied warranty of merchantability or fitness for a particular purpose.

Book Description:

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   
You can’t perform that action at this time.