Divide and Conquer, Sorting and Searching, and Randomized Algorithms に戻る

4.8

星

3,355件の評価

•

593件のレビュー

The primary topics in this part of the specialization are: asymptotic ("Big-oh") notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts)....

Sep 14, 2018

Well researched. Topics covered well, with walkthrough for exam.le cases for each new introduced algorithm. Great experience, learned a lot of important algorithms and algorithmic thinking practices.

Mar 16, 2017

Very good course in algorithms. I bought the book to help me understand but the lectures make it way easier and thus much more fun to understand the analysis. Looking forward to complete the spec

フィルター：

by Divij S

•Jan 23, 2018

I have issues with the content/style of this course. My main issue is that the course requires understanding of maths topics to understand the course content, which is fine, and the lecturer provides some review of those topics. However, my main issue/frustration is that a large part of the quizzes is about the maths which the course relies on, not on what is taught in the course itself. In other coursera CS courses, the lecturer uses some maths in explanations/lectures, which requires understanding those maths topics, but then the course does not test you on your understanding of the maths which is not taught in the course - it tests your ability to understand and implement what was taught. I understand the maths well enough that I can follow the proofs provided in the lectures, but there wasn't enough material on the maths to expect me to be able to draw conclusions by performing similar proofs on my own. This made the course quite frustrating. The result is also that though I understand the algorithms taught, if I want an in-depth understanding of the maths, proofs, and analysis, I'll have to study this topic from scratch again from another source, which makes my time spent on this course almost a complete waste.

Additionally, with the way courses are on coursera, its very hard to learn from your mistakes. You either know the answers or you don't. There's no explanation about why your answer is correct/incorrect.

I did learn a lot about algorithms and for the most part the lecturer taught well. My only complaint is that the course is set up in such a way. The content does not include enough about maths and analysis to quiz you almost solely and quite thoroughly on maths and analysis, which it does.

by Joshua S

•Oct 03, 2018

I have a degree in CS, but it's been over 15 years, so I took this course as a refresher. I've previously taken Dr. Sedgewick's Algorithms II course (also on Coursera) 4 years ago. Both courses are excellent. The Princeton course has lots of meaty programming projects that are more similar to a traditional data-structures classes. The Stanford course is a little heavier on theory, while remaining very practical. Professor Roughgarden is a fantastic lecturer, and the material is extremely well crafted with lots of fully worked examples of classic problems. While slower than Sedgewick's course, I really needed something that would pound these ideas and concepts into my head, and this course does a great job with that.

by Ian D

•Jan 03, 2019

The instructor is simply not good at explaining these concepts. In contrast to the Princeton course his explanations are dense, condescending, and totally removed from the day to day practice of software development. I would not recommend this course to anyone.

by Adam L

•Jun 12, 2017

Pros: Excellent material, well controlled audio of the dictation, quizzes encouraged thoughtful reconsideration of the material.

Cons: Some lectures could be broken down more. I think this would help with attention, retention, and review. The biggest issue was with the programming assignments. The decision made for what to report as an answer to show you've done the work seems to lead to students spending most of the time on what I call "guess the implementation problems" rather than understanding and retaining the concepts. To give a concrete example, on PA#3 I came up with implementations of quicksort that not only properly sorted the array, but did so with less comparisons than the "right implementation" that led to the answer needed for the assignment. My intial implementation was based off of the CLRS book and my own logical understanding of the algorithm. Even after having rewritten based off the suggested pseudocode from the lecture video, there was a lot of room for ambiguity in the implementation. Trying to figure out what implementation I was supposed to have seemed like an endeavor for the sake of points instead of learning, and it took up ~95% of my time spent on the problem. I feel like assignments like this are tedious and discouraging to not only learning but thinking for yourself. Ideally, we would find a way to avoid this problem while still having a way to ensure people did the work.

by Erin H

•Jun 19, 2018

As a teacher, I cannot understand why you would teach concepts by essentially writing out slides that you could have easily typed out before hand. If you are doing some interactive screen casting, utilize it by actually drawing out concepts and examples. Slides and drawings complement each other, don't just use one mode of teaching. I've never had a Computer Science instructor do this and it made it the videos almost useless. When I completed the quizzes and programming assignments, I relied heavily on internet research on concepts.

by Matthieu D

•Sep 13, 2018

Interesting and well structured course. The material is basic, but has enough depth to be challenging for someone who, like me, has minimal programming experience. The instructor explains the material very well and is engaging.

A big plus is that, unlike other similar courses, you can apply the material and answer the quizzes with any programming language you see fit.

by Bharath K N

•Oct 16, 2018

Very fast paced videos, i had to reduce the speed to 0.75x to understand.

Most of the concepts (math) are omitted from lectures but still the jargon's like "lemma" /"corollary" / "induction"/ "contradiction" are used to confuse the user without much clarity on prerequisites for the course , so in order to understand this i had to resort to other books and come back to this video for understanding.

If you are math skills are meek or you need a refresher , i suggest to pick some basic math book on probability and learn some graph theory before joining this course, trust me you would save a lot of time.

I had to jump between the video and other books, the problems are very challenging.

If you are very good in math basics and already read Intro to Algo's by Cormen, there is no much need of this course.

by Thomas N

•Feb 09, 2019

After spending a lot of time on this specialisation, you will receive a certificate upon completion which says "SOME ONLINE COURSES MAY DRAW ON MATERIAL FROM COURSES TAUGHT ON-CAMPUS BUT THEY ARE NOT EQUIVALENT TO ON-CAMPUS COURSES. THIS STATEMENT DOES NOT AFFIRM THAT THIS PARTICIPANT WAS ENROLLED AS A STUDENT AT STANFORD UNIVERSITY IN ANY WAY. IT DOES NOT CONFER A STANFORD UNIVERSITY GRADE, COURSE CREDIT OR DEGREE, AND IT DOES NOT VERIFY THE IDENTITY OF THE PARTICIPANT." Essentially, your completion certificate is a worthless paper regardless of your efforts. I think if the instructor wants to issue an online certificate, just say "Online course" and that is enough. I really felt being let down after all my efforts to listen and finish all homeworks.

by Christi J V

•Jun 11, 2017

A really exciting and challenging course. Loved the way the instructor explained everything with so much detail and precision. Definitely looking forward to the next course in the specialization.

by Faiz R

•Mar 16, 2017

Very good course in algorithms. I bought the book to help me understand but the lectures make it way easier and thus much more fun to understand the analysis. Looking forward to complete the spec

by Sergey S

•Mar 26, 2019

I've taken some other courses but this one provides really complex quizzes/exams that encourage students to learn.

by Pulkit K

•Jun 11, 2018

I don't think the course is written in a very straight forward moving method, the tutor says we'll discuss 'A' in this video but before that I'll tell you something irrelavent to 'A' and then something more again and then he tells in the end of the video what is 'A' , proper discussion about 'A' is in another video.All I can say is I'll never come back to this tutor again, very poorly managed course.

by Amit

•Nov 02, 2016

the tutorials is not for average students, it takes a very high skill to understand them . also the quiz nd the assignments r too tough.hope you can make them a bit easy, the last one ,ie with graphs and trees was a bouncer. If the maths required is so high, please take a week to first explain the math fresher required in course and then start the main course

by LUIZ O V L D G

•Oct 01, 2019

Quizzes are no clear to understand and the classes doesn´t help much as Tim seems to be in a hurry to talk, sometimes it´s better only to read te pdf´s. I´m just frustrated, doesn´t seem to be for programmers but for mathematicians.

by Atul S A

•Aug 22, 2018

Dear Prof Tim Roughgarden

I have been watching your lecture videos while taking my meals. When I do this for other courses, either I have to take out a piece of paper and scribble things to understand or they turn out to be so boring (for me) that I have to change. This course of yours was pitched at the perfect level. This is not to say the material was easy. There were so many wonderful ideas that you almost playfully conveyed with essentially zero effort required on the part of the learner. It often happens that people that understand things very well are also unable to express them to lesser mortals. You are an exception.

I must admit that I simply audited the course so I can't make any comments about the exercises.

I look forward to learning more from you. Thank you for taking the time for putting all this together. Hope you're enjoying/enjoyed your sabbatical.

—

Atul

by Sandeep P

•Aug 06, 2018

Nice introduction to algorithms. Enjoyed the programming exercises. I would recommend new users to try the assignments in python or a similar high level language to avoid getting stuck in the gory details that would entail in a low-level implementation.

by Karan S

•Sep 14, 2018

Well researched. Topics covered well, with walkthrough for exam.le cases for each new introduced algorithm. Great experience, learned a lot of important algorithms and algorithmic thinking practices.

by Ivan

•Sep 01, 2017

Amazing course. I learned a lot about algorithms, the implementation of algorithms, time complexity. I also learned a lot about being systematic and purposeful about including any line of code.

by Nikolaos E

•Nov 07, 2016

Personally, I would recommend this course to anyone who really wants to learn how things work in that sort of algorithms. I found the assignments a little difficult, but also extremely helpful.

by Bakhtiar R

•Nov 03, 2017

Very poor explanation. Accept more in depth explanation. Cant move forward after few lectures.

by Vladimir M

•Oct 18, 2019

Initially, I wanted to rate this course to 4 points, but after deep reflection I decided that the problems I faced are related to my background, not the course itself.

Probably for recent students who still remember Probability Theory and Math Analysis this course would be easier. I graduated 11 years ago and for me, it was extremely challenging to keep the pace (theory, assignments, and programming homework).

This course made me refresh (read "learn from scratch") some aspects of a bunch of areas, but eventually, I should say it gives me confidence now when I'm passed that everything is possible to be learned.

For those who sitting on a fence and considering this course as a step for Software Engineer interview preparation, I'd say probably it's not the best way to do it. There are many more materials oriented to interview preparation.

I recommend this course only if you like learning or want to be an expert in algorithm analysis.

by Nadim H

•Sep 11, 2017

Challenging and highly informative course. Professor Roughgarden has a concise and candid lecturing style that I found easy and pleasant to follow.

Make sure you're comfortable with one programming language, and have some experience in writing programs. There is a lot of math, and while not super advanced, make sure you've brushed up on: logarithmic identities, infinite sums, and counting (permutations and combinations). The course dives into some probability, but Professor Roughgarden will walk you through some optional (and very instructive) review lectures.

I'm looking to finishing the specialization, but I'll take some time off to review my discrete mathematics, and strengthen my programming first. This is my first MOOCS course, and I'm hoping all my future experiences will be as great. I highly recommend the course and Professor Roughgarden's lectures.

by zeinab s

•May 02, 2019

I audited this course and I believe this course is going to help me build my future career. I'm in transition between my original degree (engineering) to computer science, and I want to build a great foundation of my knowledge. For me, with little computer knowledge, this course was great. The syllabus is complete and covers essential material. The instructor explains everything clearly. although he talks a bit fast for me (I'm not native but I'm studying in an english language school).

It is a good combination of the algorithms and the math behind them. not too much math. The homework at the end of each week is also helpful to practice what you learned in videos. (Although I couldn't see the answers)

in Overall, it's a great course, and I recommend it to anyone with a passion for computer science.

by Steve J

•Sep 20, 2018

I found this course to be an ideal mix of abstract theory and practical application. Professor Roughgarden is quite adept at presenting in depth analyses of algorithms in a way that does not shy away from formal mathematics but also does not require a degree in mathematics to understand. For me, whose prior math coursework was mainly focused on areas of math not as prevalent in computer science as other in disciplines (e.g. calculus vs. discrete math), Professor Roughgarden's approach is ideal and opened up the door to a much deeper understanding of algorithms than I've acquired on my own over a multi-decade career in programming.

Highly recommend this course for anyone who, like me, has a lot of experience with programming, but no formal training on algorithms.

by Cliff C

•Nov 25, 2017

Loved the clarity and enthusiasm. The proofs and algorithm implementations shared in this class are often simpler and more elegant than the proofs and implementations I've found in other textbooks.

Just a few examples: 1. The proof of Quicksort's expected comparisons count was great. The course used a beautiful, simple proof summing the values of indicator variables whereas other proofs I've seen use a messy inductive approach. 2. The implementation of partition was much simpler than most other partition implementations I've seen, which tend to walk from the left and right swapping items.

The simplicity of the proofs and algorithm implementations make the material more beautiful. Thank you!