Data Structures and Algorithms Made Easy: Data Structures and Algorithmic Puzzles, 5/e (Paperback)
Narasimha Karumanchi
- 出版商: CareerMonk Publicati
- 出版日期: 2016-08-28
- 售價: $1,800
- 貴賓價: 9.5 折 $1,710
- 語言: 英文
- 頁數: 434
- 裝訂: Paperback
- ISBN: 819324527X
- ISBN-13: 9788193245279
-
相關分類:
Algorithms-data-structures
立即出貨
買這商品的人也買了...
-
$1,421C Programming: A Modern Approach, 2/e (Paperback)
-
$620$527 -
$3,120$2,964 -
$1,715Introduction to Algorithms, 3/e (Hardcover)
-
$1,710$1,625 -
$2,150$2,043 -
$680$578 -
$1,615Cracking the Coding Interview : 189 Programming Questions and Solutions, 6/e (Paperback)
-
$6,631Computer Systems: A Programmer's Perspective, 3/e (美國原版)
-
$1,710$1,625 -
$505Linux 環境編程 : 從應用到內核
-
$490$382 -
$580$458 -
$420$328 -
$480$379 -
$520$442 -
$690$538 -
$390$332 -
$450$356 -
$1,200$1,140 -
$1,140$1,117 -
$1,980$1,881 -
$1,650$1,617 -
$840Hands-On Data Structures and Algorithms with Python: Write complex and powerful code using the latest features of Python 3.7, 2/e (Paperback)
-
$1,420$1,392
相關主題
商品描述
Description
"Data Structures And Algorithms Made Easy: Data Structures and Algorithmic Puzzles" is a book that offers solutions to complex data structures and algorithms. There are multiple solutions for each problem and the book is coded in C/C++, it comes handy as an interview and exam guide for computer scientists. It can be used as a reference manual by those readers in the computer science industry. This book serves as guide to prepare for interviews, exams, and campus work. In short, this book offers solutions to various complex data structures and algorithmic problems.
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
商品描述(中文翻譯)
「資料結構與演算法輕鬆學:資料結構與演算法謎題」是一本提供複雜資料結構與演算法解決方案的書籍。每個問題都有多個解決方案,並以C/C++編寫,對於電腦科學家來說,這本書在面試和考試中非常實用。對於電腦科學行業的讀者來說,它也可以作為參考手冊。這本書是為了準備面試、考試和校園工作而設計的指南。總之,這本書提供了各種複雜的資料結構和演算法問題的解決方案。
涵蓋的主題包括:
- 簡介
- 遞迴和回溯
- 連結串列
- 堆疊
- 佇列
- 樹
- 優先佇列和堆積
- 不相交集合 ADT
- 圖形演算法
- 排序
- 搜尋
- 選擇演算法(中位數)
- 符號表
- 雜湊
- 字串演算法
- 演算法設計技巧
- 貪婪演算法
- 分治演算法
- 動態規劃
- 複雜度類別
- 其他概念