Data Structures and Algorithms Made Easy in Java: Data Structure and Algorithmic Puzzles, 2/e (Paperback)

Narasimha Karumanchi

  • 出版商: CareerMonk
  • 出版日期: 2011-12-16
  • 售價: $1,350
  • 貴賓價: 9.5$1,283
  • 語言: 英文
  • 頁數: 450
  • 裝訂: Paperback
  • ISBN: 8192107558
  • ISBN-13: 9788192107554
  • 相關分類: Java 程式語言Algorithms-data-structures
  • 下單後立即進貨 (約1週~2週)




Peeling Data Structures and Algorithms for (Java, Second Edition): Data Structure and Algorithmic Puzzles
  • Programming puzzles for interviews
  • Campus Preparation
  • Degree/Masters Course Preparation
  • For Instructor's
  • Big job hunters: Microsoft, Google, Apple, Amazon, Yahoo, FlipKart, Adobe, IBM Labs, Citrix, Mentor Graphics, NetApp, Oracle, Face book, McAfee and many more
  • Reference Manual for working people
Video Link:

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   

Target Audience?
These books prepare readers for interviews, exams, and campus work. 


All code was written in Java. If you are using C/C++, please search for "Data Structures and Algorithms Made Easy".

Also, check out sample chapters and the blog at:



《Peeling Data Structures and Algorithms for (Java, Second Edition):資料結構和演算法的解析(Java 第二版)》是一本針對資料結構和演算法相關的複雜問題提供解決方案的參考手冊。這本書適用於計算機科學專業人士,並可作為他們在計算機科學行業中的參考手冊。


《Peeling Data Structures and Algorithms for (Java, Second Edition):資料結構和演算法的解析(Java 第二版)》由Narasimha Karumanchi於2011年出版,使用Java編寫。這本書可作為準備面試、考試和校園工作的指南,也有C/C++版本。總之,這本書提供了各種複雜資料結構和演算法問題的解決方案。



這本書的程式碼都是用Java編寫的。如果您使用的是C/C++,請搜索「Data Structures and Algorithms Made Easy」。同時,請查看CareerMonk.com上的示例章節和部落格。