This course is excellent. The instructor gives detailed, helpful lectures complete with clear examples that help solidify the concepts. The readings supplement the lectures nicely. The assignments are of appropriate difficulty and reinforce what we learn in the course material. I look forward to taking more courses with Sriram!

To me many things taught in the course are not clear enough. I had to guess what the instructor wanted to say frequently.

unclear and messy

This is probably the closest you can get to a univesity course in Data Structures and Algorithms.

The lectures are detailed yet concise. Not too mathy but also not the easiest.

The quizzes solidifies your understandings and corrects your misundertandings.

There seems to be inconcistencies in the quality in programming assignments but overall, for example the programming assignment in MST encourage the "bad" use of dictionaries, while in the Shortest Path programing assignment, it encourages more clever use of data structures (i.e. idx). Still, overall, the programming assignments are good and they make you appreciate more the lessons.

Detailed lectures and thoroughly taught!

Interesting programming assignments.

But the operations on tree/graph could have been better explained using animated videos rather than whiteboard scribblings.

I have grade 100% My mail id- [email protected]

Some typos are not acknowledged. The evaluations are disconnected from the lectures.

very solid course - would love more programming assignments and tougher final

This course is a great source to learn the basics of graph data structures and algorithms, as the name of the course suggests. The only problem is last week's assignment in my opinion. The final assignment seems extremely daunting at first glance but using the pseudo-code provided, it becomes trivial. I felt like I didn't learn anything from the last week's assignment., and it kinda felt like cheating! Apart from that though, a really great course.

Pretty thorough. Lectures are great, and quizzes help test your understanding. The assignments do the job, and, are at times, a bit of a puzzle to figure out. I enjoyed the lectures and felt like I learned and was challanged. One will need more practice and study to achieve mastery following the course, but you'll defintiely come out of it with a far greater understanding of the trees and graphs.

Great course to review trees/graphs and their related algorithms. The second programming assignment was a bit unclear at times but the others were straightforward, with the final one being very interesting! Highly recommend to those looking to brush up on their algorithms knowledge.

Another marvelous course to join if someone finished the first course about indexing and sorting. This course really tought be to thnik in different ways while programming. Thank you all associated with the course.

The CLRS version for University of Colorado students to access online has some Chapter number changes leading to confusion about what chapter to read in weeks 3 and 4 of this course.

Very satisfying final assignment. The course is great as a whole too. (But my courseraplus will expire soon. So perhaps this is the last one I take from this specialization.)

Excellent explanation of complex topics. The coding exercise are also well thought out and the tips along the way help to reinforce key concepts.

This course is definitely hard but for some good reason. It stretches the mind of the learner/student to achieve algorithmic nirvana.

Excellent content. Lectures along with textbook provide student with working knowledge of trees and graphs.

A great course. The lectures are easy to follow and the assignments are not too difficult to finish.

This course is easy to understand and implement. It needs more programming exercises further!

Mi duda es si este curso te da certificado, pues lo completé al 100% , aun asi lo recomiendo

Hola, No he podido recibir el certificado ya habiendo terminado el curso con éxito

Great lecturer and course materials. Assignments were fun also

Excelente contenido, facilita el aprendizaje.

All pairs shortest path needs more explaining

Awesome assignments!