Search Books
The Rhetoric of Code: Essay… iPhone iOS 5 Development Es…

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

Author Narasimha Karumanchi
Publisher CreateSpace Independent Publishing Platform
Category Computers
📄 Viewing lite version Full site ›
🌎 Shop on Amazon — choose country
25.29 44.99 USD
🛒 Buy New on Amazon 🇺🇸 🏷 Buy Used — $23.00

✓ Usually ships in 24 hours

Share:
Book Details
ISBN / ASIN1466304162
ISBN-139781466304161
AvailabilityUsually ships in 24 hours
Sales Rank1,015,627
CategoryComputers
MarketplaceUnited States 🇺🇸

Description

Peeling Data Structures and Algorithms [re-printed on 19-August-2016]:Table of Contents: goo.gl/hMYJGqSample Chapter: goo.gl/DqVs8pSource Code: goo.gl/e3imfVVideos: 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
C++: Object-Oriented Data Structures
View
Fundamentals of Logic Design
View
Articulating Design Decisions: Communicate with Stakeh…
View
Make: FPGAs: Turning Software into Hardware with Eight…
View
Robots and Biological Systems: Towards a New Bionics?:…
View
Modern Perl
View
Emerging Trends in Image Processing, Computer Vision a…
View
Autodesk 3ds Max 2012 Essentials
View