Monday, July 15, 2019

Algorithms Illuminated Pdf

ISBN: 0999282905
Title: Algorithms Illuminated Pdf Part 1
Author: Tim Roughgarden
Published Date: 2017-09-27
Page: 218

Tim Roughgarden is a Professor of Computer Science and (by courtesy) Management Science and Engineering at Stanford University, where he has taught and researched algorithms since 2004. This book is the first of a four-part series based on his online algorithms courses that have been running regularly since 2012.

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 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.

Can’t wait for part 2 Like many people I’ve taken Tim’s algorithms course. It’s an excellent course so I bought the book sight unseen. I was a bit bummed to see no coverage of graph algorithms or dynamic programming. The book is listed in parts so that shouldn’t come as a surprise.If you’re looking for specific material be sure to check the table of contents to see that it will be covered.Overall, I can’t wait for more editions to be released.No answers to end-of-chapter problems I think that the book provides a great introduction to the topic, and I quite like how the author strikes the balance between theory and illustration of the concepts using concrete examples. That said, there is one major issue with this book -- the problems at the end of each chapter are essentially useless as there are no answers or even hints to verify that you have actually understood the topic. I find it particularly funny that the author calls these sections 'Test Your Understanding' and then does not provide the answers (what? :).To be fair, you could ask for a hint in the discussion forum of the book, e.g. "I'm thinking that I should do x,y,z to solve the problem. Am I right?", but you will never know the final answer. The reason for such a policy is that the author also has a Coursera class and uses problems from the book there. Downside: I guess you will have to pay for the certificate version of the class to know the answers to the problems. Upside: it is helpful to watch him present the material on Coursera and then double down by reading the book.In the end, I wish there was an explicit disclaimer about this situation. I hope that later issues of the book (and later books in the sequence) will have an independent set of problems.Solutions to the problems are not provided At the end of each chapter there is a comprehensive set of problems provided to help you verify that you understood the material. However unlike most books this one does not provide solutions for said problems. In investigating further on line, I found that The author purposefully omits the answers because the questions are the same as found in his coursera course.If the book was marketed as a companion to his coursea course, then that would be ok i suppose. However, the lack of solutions makes this book far less practical in my opinion. Would it have been so hard for the author to come up with the distinct problems for the book?Because of the ommission, I have to mark it down to two stars

Commodity Algorithms and Data Structures in C pdf

Algorithms (4th Edition) pdf

Hands-On Data Structures and Algorithms with Rust pdf

Hands-On Data Structures and Algorithms with Python pdf

Algorithms of the Intelligent Web pdf

Machine Learning with Spark - Tackle Big Data with Powerful Spark Machine Learning Algorithms pdf

Learn Data Structures and Algorithms with Golang pdf

Tags: 0999282905 pdf,Algorithms Illuminated pdf,Part 1 pdf,Tim Roughgarden,Algorithms Illuminated: Part 1: The Basics,Soundlikeyourself Publishing,0999282905,Algorithms,Algorithms; programming; computer science,COMPUTERS / Computer Science,COMPUTERS / Programming / Algorithms,COMPUTERS / Programming / General,Computers/Computer Science,computer science,programming

No comments:

Post a Comment

Note: Only a member of this blog may post a comment.