Algorithms Illuminated (4 book series)

Tình trạng: Còn hàng

Tác giả: Soundlikeyourself Publishing

Loại: Algorithms

Algorithms are the heart and soul of computer science. Their applications range from network routing and computational genomics to public-key cryptography and database system implementation. Studying algorithms can make you a better programmer, a clearer thinker, and a master of technical interviews. Algorithms Illuminated is an accessible introduction to the subject---a transcript of what an expert algorithms tutor would say over a series of one-on-one lessons. The exposition is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details.

[Xem chi tiết]

90.000₫ ~~120.000₫~~

Mô tả

I. THÔNG TIN SẢN PHẨM
Mã sản phẩm : CB571A-D
Nhà xuất bản: Soundlikeyourself Publishing
Tác giả : Tim Roughgarden
Ngôn Ngữ : Tiếng Anh
ISBN : 0999282905, 0999282921, 0999282948, 0999282964
Số trang ‏ : ‎ 226, 235, 232, 273 pages
Hình thức : Bìa Mềm, IN ĐEN TRẮNG
Loại : Sách gia công đóng gáy keo chắc chắn chất lượng cao
Giấy in : Giấy ngoại định lượng 70msg, viết vẽ và hightlight thoải mái.
Chất lượng : Bản in rõ nét, giá rất tốt cho mọi người.

II. MÔ TẢ SẢN PHẨM

1.Mô tả sản phẩm
A.Algorithms Illuminated: Part 1: The Basics Illustrated Edition
Part 1 covers asymptotic analysis and big-O notation, divide-and-conquer algorithms and the master method, randomized algorithms, and several famous algorithms for sorting and selection.

B.Algorithms Illuminated (Part 2): Graph Algorithms and Data Structures Illustrated Edition
Part 2 covers graph search and its applications, shortest-path algorithms, and the applications and implementation of several data structures: heaps, search trees, hash tables, and bloom filters. (Part 1 is not a prerequisite.)

C.Algorithms Illuminated (Part 3): Greedy Algorithms and Dynamic Programming Illustrated Edition
Part 3 covers greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, shortest paths, optimal search trees).

D.Algorithms Illuminated (Part 4): Algorithms for NP-Hard Problems
Part 4 covers algorithmic tools for tackling NP-hard problems (heuristic algorithms, local search, dynamic programming, MIP and SAT solvers) and techniques for quickly recognizing NP-hard problems in the wild.

2. Tác giả
Tim Roughgarden is a Professor of Computer Science at Columbia University. Prior to joining Columbia, he spent 15 years on the computer science faculty at Stanford, following a PhD at Cornell and a postdoc at UC Berkeley. His research interests include the many connections between computer science and economics, as well as the design, analysis, applications, and limitations of algorithms.