The course is badly designed and is not a par with the previous 2 courses.

① the 1st week courses was daunting and convoluted. It was meant to introduce the idea of divide and conquer which the previous courses have involved a little bit, but it spent a great deal of time introducing Fourier transform without elaborating it clearly (actually I have to watch more relevant videos on Yotube to get it across). What's worse, the quizz and assignment are focused on the math theorem of Fourier transform instead of more concret cases of divide and conquer algorithm.

② the 2nd week is about dynamic programming, which is probably the most difficuly one in the course because it's rather abstract and hard to implement & debug in programming. I do appreciate that the instructor has been persisting in blackboard writing for the whole series, but honestly I believe it would be more vivid if those cases taught in the class could be visualized by plots/tables and it would be much more helpful if there could be at least one video leading us walk through the python codes and show us how to debug when there's error. The reason why I propose such ideas is because when I was doing the assignment, I found it very hard to conceive a proper data structure and troubleshoot the code when the answer was incorrect with no other prompt.

③ the 3rd week around greedy algorithms is realtively nice and concise. By comparison, the 1st and 2nd week are truly freting.

④ the 4th week's content is not vague, just looking quite irrevelant at first glimpse though. However, the assignment is quite hard to pass because is sets time limit for running the codes, but what is contradicting is that the course is about non-deterministic polynomial problems which cannot be solved effciently. So it puzzles me a lot because there's almost no way to find a faster solution. I saw other people were raising similar problems in the forum too, but unfortunately there's no helpful advice given by teaching assistants (honestly they seldom reply).

What is the point of the discussion boards if no one responds? There is no way to get help if you need it.

i went through this course just for a quick refresh on some basic algorithms and i ended completing all three courses from the specialization! the explanations from Pr.Sriram Sankaranarayanan are crystal clear and the way he presents the material is super! i finnaly understood dynamic programming and P-NP complexity classes, topics that were very comfusing for me. Thank you Proffesor!

Excellent. This course covers some difficult topics, but the lectures and homework assignments were superb and made them quite approachable.

Interesting topics, but the programming assignments are extremely difficult and made the class feel tedious. I eventually solved them, but would not reccommend the experience.

Assignment language should be clearly mentioned.

Very good course. The only problem was the lack of support on the forum. For example, when I posted a question about the forth week's assignment I noticed that the was only one other post there from nine moths ago. That person never got a reply whereas I did.

underexplained, messy, many typos, unorganized

This course save me time on learning the dynamic programming. I really love the 4-steps to construct the dynamic programming. It gives me the guideline when designing DP solution.

Excellent course! I really learned alot and enjoyed all the challenges and topics in your course. Thank you so much!

The Dynamic Programming and Greedy Algorithms course was bit disappointing, primarily due to its focus on mathematical aspects, rather than fostering logic-building skills. The course overly emphasized algebraic techniques, which detracted from practical problem-solving. As a result, there was minimal engagement with the real-world logic that drives dynamic programming and greedy algorithms. For those hoping to strengthen their algorithmic thinking, the course fell short of providing balanced, hands-on learning. I would recommend below part 1 and 2 course https://kidlove.top/learn/algorithms-part1 by Professor Robert Sedgewick.

very good courses

d

-1 star for the annoyingly graded tests -1 star for the bug in the last programming exercise -1 star for the hidden optimisation test on the last programming exercise Ridiculous ...

This is an excellent course! A lot harder than its predecessors 5501 and 5502, with a lot more content volume and a clear step up in the level of difficulty. Completing 5501 and 5502 helped me get used to the format, assignment, and delivery style. The content density is very high. This course could easily be a specialization with 3 to 5 sub-courses itself, which would allow for a smoother pace and more algorithm coding practice. The time estimates for completion are quite accurate; I felt they were a bit understated since I took longer to go deeper in the dynamic programming piece of the course. Overall, this is an awesome course!

This course is significantly harder than the first 2 courses in this specialization. The concepts are difficult, and the programming assignments reflect that as well. This is the tipping point where there is a shift in focus from data structures to more algorithms and problem-solving. Dr. S guides you through the general approaches to solving problems using everything you've learned so far and gives you the freedom to formulate your solutions using these approaches during the programming assignments.

Dr. Sriram Sankaranarayanan did a good job introducing the basics of algorithms to us. However, their handwriting was sometimes unclear, making it difficult to read. As a beginner, I found the quizzes appropriate in quantity, but at times too challenging. I spent a significant amount of time trying to figure out how to solve the problems. Overall, this is a great course, and I would recommend it to every beginner in computer science.

This is one of the courses I have spent a lot of time on. It is very interesting, and the professor is very knowledgeable. I recommend this course and the previous two courses for anyone who wants to pursue a career in science and engineering. I have even recorded every single video for my own reference.

Great course on dynamic programming and greedy algorithms. Well-structured. The only problem I had is that the Quantum Algorithms supplementary videos seem very shoehorned in with no build-up of prior knowledge. Since it is not graded though, I will keep my 5 star review of this course as is.

Content is awesome plus the instructor is writing the relevant things on screen which makes it easy to understand. The instructor repeats again which helps to grasp the difficult concept and the writing style helps in note taking. Thanks for such an awesome course ; )

Super interesting topics, excellent practical coding assignments to put the knowledge into practice, and being able to retake the quizzes until you get it all right actually corrected a misunderstanding I had about at least one concept after watching the lectures.

Great work from professor Sriram Sankaranarayanan explaining such complex material. I wish we could review more examples during the class (specially Dynamic Programming ones).

I totally loved all the courses from this instructor. The content was rich, the programming assignments were instructive, and the whole course was so engaging.

A clear presentation of the topics. Well organized. The quizzes and problems are interesting and challenging.

Instructor's material was really good and was very effective in communicating the complex topics

Amazing opportunity to learn! A Stanford graduate as a professor, OMG! Super bright!