Algorithms Illuminated (Part 2): Graph Algorithms and Data Structures by Tim Roughgarden (PDF)

Description

Accessible, no-nonsense, and programming language-agnostic introduction to algorithms. Includes solutions to all quizzes and selected problems, and a series of YouTube videos by the author accompanies the book. 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.)

User’s Reviews

Reviews from Amazon users which were colected at the time this book was published on the website:

⭐It’s little different compare to knuth. But I think it’s more practical book compare to others.P. S. I think strong part of it it’s explanations of algorithms . I able to understand what author try to explain .

⭐The “Algorithms Illuminated” series is a great balance between technical rigor (e.g. formal proofs) and brevity. I am a big fan of “Introduction to Algorithms” by Cormen, Leiserson, Rivest, and Stein, but it is a hefty tome that requires more time to digest, and for a student studying algorithms for the first time, it is easy to lose the forest for the trees. By contrast, “Algorithms Illuminated” gets to the point quickly for each new algorithm and data structure while at the same time providing deep insights that are often missing from “Introduction to Algorithms.”If you have the bandwidth (and inclination), I recommend reading both books, but if you are pressed for time, “Algorithms Illuminated” cannot be beat.

⭐Prof. Roughgarden is my all-time favorite instructor. His style is clear, concise, humorous, and direct to the essence of algorithms, 5 minutes can make clear what my instructor failed to for a semester. Prof. Roughgarden has impacted me profoundly on three levels. First, he made the algorithm knowledge clear and I may owe my future job to him. Second, he ignited my passion for algorithm, math, and general computer science, the journey is so fun guided by a charming master. The third level inspiration was his direct-to-the-essence minimalist philosophy, things get simple after you know the essence and only in this way can you hold more. Thank you so much Prof. Roughgarden and Merry Christmas!!!

⭐I love Prof. Tim’s leaching style, which has been reflected in this series of books. The writing is very concise and yet conversational, with that cut-to-the-chase style, I found, for the first time, reading algorithmic books is very delightful experience. It’s not that easy to drift away.There are many practical suggestions. For instance, to design hash functions “you should leave it to experts if at all possible”. I cannot agree it more :). Also you’ll find some interesting footnotes referring in-depth materials for more curious readers.I also like splitting the whole algorithmic topic to multiple parts ( 4 in this case ), with each book only having over 200 pages, making those seemingly daunting topics much accessible to readers and learners. I’m very much looking forward to reading part 3&4.

⭐Good job of explaining tough concepts. Helped my prep for my Google interview and gave me a very good understanding of some data structures I used for the interview

⭐I would recommend this book to anybody who study algorithms and data structures (either in universities or in professional life). Professor Tim Roughgarden has an outstanding talent and gift to explain complex things in a simple and clear way. The book is written in spirit similar to online courses developed by Tim Roughgarden, and it is great both as individual learning source, or in pair with MOOC.

⭐That’s the typo or printing error happening at least 10 times. Never seen something like this. I guess the editor or publisher is doing a lousy job.

⭐Wish it included Dynamic Programming as well though. It’s an important technique in your toolkit especially for coding interviews. Any plans of doing a Part 3 focusing on backtracking, recursion and dynamic programming prof Rougharden?

⭐Really well written and a challenging subject explained clearly throughout. It will be worth spending time to close read through the book to the end. Also, looking forward to when Part 3 and then Part 4 will be published. A great series so far.

⭐I am doing a PhD in Machine Learning and found this series Amazing! The exposition of the topics is soo smooth. Manages to convey complex topics in very understandable way. I have the whole series.

⭐Muy fácil de digerir. Los algoritmos son totalmente comprensibles, la redacción es amena, y hasta los programadores con años de experiencia podemos aprender cosas de este libro.Además de los algoritmos básicos de grafos, y el repaso a estructuras como hash tables, he adquirido recursos nuevos, como el Heap o los Bloom Filters (de los que había sentido hablar pero nunca me había parado a entender)Un imprescindible en mi biblioteca.O livro, assim como o restante do material disponível para acompanhar o curso é muito bom. Estou acompanhando os vídeos das aulas que tem no site do livro e fazendo as atividades sugeridas na página oficial da disciplina em Stanford. No site da disciplina tem os slides e quais os capitulos devemos ler antes de cada aula. A única coisa que achei estranha foi a parte 2, que veio com a impressão da capa com uma textura diferente das demais.Es un buen libro con buenos conceptos, creo que le falta algo de ejercicios, pero en definitiva si quieres tener una idea clara de esas estructuras de datos debes de leerlo

⭐

Keywords

Free Download Algorithms Illuminated (Part 2): Graph Algorithms and Data Structures in PDF format
Algorithms Illuminated (Part 2): Graph Algorithms and Data Structures PDF Free Download
Download Algorithms Illuminated (Part 2): Graph Algorithms and Data Structures 2018 PDF Free
Algorithms Illuminated (Part 2): Graph Algorithms and Data Structures 2018 PDF Free Download
Download Algorithms Illuminated (Part 2): Graph Algorithms and Data Structures PDF
Free Download Ebook Algorithms Illuminated (Part 2): Graph Algorithms and Data Structures