Very bad course content for some modules

Many abstract concepts and mathematical terms but with severe lack of explanation of the terms and lack of specific, concrete examples to help learners to understand them

For example: in LP module there should be example of how the primal and dual matrix looks. How simplex algorithm is used on a specific example (showing explicit graph). I undertood only 25% of what was discussed about in this module

No motivation to move on after week 2!

Other weeks are slightly better

In summary: Too many abstract concepts with little examples

Loved what I learnt, I also implemented a project using Google MAP API for the organization I'm working at

Thank you very much for this awesome course, I really enjoyed and learned alot from it.

I really liked the selected topics, they act like an intro to some really interesting fields in the programming.

I've learned about NP multiple times but never found a use to it until now, the problems were really good and informative.

I think the linear programming was pretty rushed, it should've been expanded over two weeks with more in details.

Maybe add a problem or explain the use of duality .

As usual, complex arguments explained in simple terms!

Some problems are really tough! (e.g. there's a problem from Google Code Jam).

Thank you for this course!

Very Very Challenging Course , it test your patience and rewards is extremely satisfying. Lot of learning on a complicated subject of NP-Hard problems.

This course is wonderful.I am really feel like I have all knowledge of adsa

Thank you very much. I learned a lot in this course. I recommend it!

Liked this course, at least there are courses for advanced level.

Was fun learning advanced stuff and implementing algorithms.

Very well made course with challenging algorithm problems.

Great Courses!. Thanks for this wonderful specialization!

An incredible course,the exercises were very interesting

This is how algorithms should be taught.

When they say advanced algorithms and complexity, they mean it. I was initially under the presumption that it would be a straight forward video course, without any assignments. But when I had to start with programming assignments that's when the real test started. Amazing set of tutorials. Would have liked if the courses had more varied examples.

I enjoyed the course a lot. I cannot thank the instructors enough.

It would have been more interesting if we could go deeper on linear programming, such as extension to integer programming. The discussion about the duality was a bit too fast to me.

Great course again! The problems are considerably more difficult than in the previous courses in this specialization. The only problem is that the forum interaction with TAs is nonexistent, if you stuck with a problem, you have to solve it alone.

This is a tough course compared to the previous courses in this specialization. The cover of NP-complete problems using two weeks time is especially valuable. The course team has also done a fantastic job in designing the programming assignments.

Excellent but tough course ,you need to work and it is not simply called advanced Algorithms and Complexity.

You will be forced to test your code properly ,even if you didn't do it properly in the previous specialisation course.

I very enjoyed this course! Theoretic informatics - is my favorite field of study. All the professors are the best. Dreaming to enroll in your Ph.D. program. Thank you very much

Another great course in this specialization with challenging and interesting assignments. However, this one is somewhat harder but rewarding.

This is a very challenging course in the specialization. I learned a lot form going through the programming assignments!

This course is very difficult. Possible to pass programming assignments only after finishing previous courses.

Very good collection of advanced topics, even useful for the 6th course in the specialization!

I am not good in this course. But I'm always try the best! Awesome course, thank you so much!

Need more test cases for assignments.