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

Narasimha Karumanchi

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

買這商品的人也買了...

相關主題

商品描述

Video Link: youtube.com/watch?v=l_GRquIrVyg

Peeling Data Structures and Algorithms for (Java, Second Edition):
  • Programming puzzles for interviews
  • Campus Preparation
  • Degree/Masters Course Preparation
  • Instructor's
  • Big job hunters: Microsoft, Google, Apple, Amazon, Yahoo, Flip Kart, Adobe, IBM Labs, Citrix, Mentor Graphics, NetApp, Oracle, Face book, McAfee and many more
  • Reference Manual for working people
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.

Language?

All code was written in Java. If you are using C/C++, please search for "Data Structures and Algorithms Made Easy" (ISBN:   978-1468108866).

Also, check out sample chapters and the blog at: CareerMonk.com

商品描述(中文翻譯)

影片連結: youtube.com/watch?v=l_GRquIrVyg

《Peeling Data Structures and Algorithms for (Java, 第二版)》:
- 面試程式設計謎題
- 校園準備
- 學位/碩士課程準備
- 專業人士的參考手冊
- 面向大型求職者: 微軟、谷歌、蘋果、亞馬遜、雅虎、Flip Kart、Adobe、IBM Labs、Citrix、Mentor Graphics、NetApp、Oracle、Facebook、McAfee等等

獨特之處:
我們的主要目標不是提出關於資料結構和演算法的定理和證明。我們採取了直接的方法，解決了各種複雜度的問題。換句話說，每個問題對應多個不同複雜度的解法。換句話說，我們列舉了可能的解法。採用這種方法，即使出現新的問題，我們也能根據您的優先順序提供不同的解決策略的選擇。

涵蓋的主題:
- 簡介
- 遞迴和回溯
- 鏈結串列
- 堆疊
- 佇列
- 樹
- 優先佇列和堆積
- 不相交集合 ADT
- 圖形演算法
- 排序
- 搜尋
- 選擇演算法 [中位數]
- 符號表
- 雜湊
- 字串演算法
- 演算法設計技巧
- 貪婪演算法
- 分治演算法
- 動態規劃
- 複雜度類別
- 其他概念

目標讀者:
這些書籍為讀者準備面試、考試和校園工作。

程式語言:
所有程式碼都是用 Java 撰寫的。如果您使用 C/C++，請搜尋「Data Structures and Algorithms Made Easy」(ISBN: 978-1468108866)。

此外，請參閱樣本章節和博客: CareerMonk.com

類似商品