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

  • By Narasimha Karumanchi
  • Pages 450
  • Year 2013
  • Publisher CareerMonk Publications
  • Language en
  • ISBN 9788192107554
  • File Size 175.21 MB
  • File Format PDF , EPUB , MOBI , AZW3
  • Download Counter 858
  • Amazon Link
  • Google Book Link

Ebook 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/BcHq74A 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:IntroductionRecursion and BacktrackingLinked ListsStacksQueuesTreesPriority Queue and HeapsDisjoint Sets ADTGraph AlgorithmsSorting   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

Comments

blog comments powered by Disqus
logo