Brand: CreateSpace Independent Publishing Platform

Data Structures And Algorithms Made Easy In Java: Data Structure And Algorithmic Puzzles, Second Edition

  • Publish Date: 2011-12-16
  • Binding: Paperback
  • Author: Narasimha Karumanchi

Regular price $59.33 now $42.59

Attention: For textbook, access codes and supplements are not guaranteed with used items.

Arrives in 3-7 Business Days

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 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:
  1. Introduction
  2. Recursion and Backtracking
  3. Linked Lists
  4. Stacks
  5. Queues
  6. Trees
  7. Priority Queue and Heaps
  8. Disjoint Sets ADT
  9. Graph Algorithms
  10. Sorting
  11. Searching
  12. Selection Algorithms [Medians]
  13. Symbol Tables
  14. Hashing
  15. String Algorithms
  16. Algorithms Design Techniques
  17. Greedy Algorithms
  18. Divide and Conquer Algorithms
  19. Dynamic Programming
  20. Complexity Classes
  21. 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

Customer Reviews