What are MOOCs?

How do I register?

To register for a course, click on "Go to Class" button on the course page. This will take you to the providers website where you can register for the course.

How do these MOOCs or free online courses work?

MOOCs are designed for an online audience, teaching primarily through short (5-20 min.) pre recorded video lectures, that you watch on weekly schedule when convenient for you. They also have student discussion forums, homework/assignments, and online quizzes or exams.

3 out of 3 people found the following review useful

12 months ago
**completed** this course.

Part 2 picks up where part 1 left off, so completing part 1 fist is highly recommended. Major topics covered in part 2 include minimum spanning tree algorithms, the knapsack problem, dynamic programming, shortest path problems, the traveling salesman problem, P vs. NP and NP completeness and heuristics for hard problem
Read More

Part 2 picks up where part 1 left off, so completing part 1 fist is highly recommended. Major topics covered in part 2 include minimum spanning tree algorithms, the knapsack problem, dynamic programming, shortest path problems, the traveling salesman problem, P vs. NP and NP completeness and heuristics for hard problems.

Part 2 is considerably harder than part 1 and the algorithms you write for homework need to be implemented well to get answers in a reasonable amount of time and without exceeding your system's memory. It is possible to complete the class using a high-level language like Python, but you'll probably have to spend a bit more time tweaking your code to get solutions in a reasonable amount of time. In the end I was able to solve all the programming assignments, but this one is definitely not for the feint of heart. I'd like to post some of the algorithms I wrote for the course, but it is against the Coursera honor code to make solutions available to others.

My biggest gripe with the class is that the coverage of the P vs. NP question and NP completeness is brief, so students don’t gain a deep understand of what P vs. NP and NP completeness really mean. The introduction to theoretical computer science by Udacity provides a much more through overview of that particular topic. That said, the overall quality of the instruction and assignments in this course are top notch and I'd highly recommend parts 1 and 2 to anyone looking for a solid foundation in algorithm design and analysis.

Part 2 is considerably harder than part 1 and the algorithms you write for homework need to be implemented well to get answers in a reasonable amount of time and without exceeding your system's memory. It is possible to complete the class using a high-level language like Python, but you'll probably have to spend a bit more time tweaking your code to get solutions in a reasonable amount of time. In the end I was able to solve all the programming assignments, but this one is definitely not for the feint of heart. I'd like to post some of the algorithms I wrote for the course, but it is against the Coursera honor code to make solutions available to others.

My biggest gripe with the class is that the coverage of the P vs. NP question and NP completeness is brief, so students don’t gain a deep understand of what P vs. NP and NP completeness really mean. The introduction to theoretical computer science by Udacity provides a much more through overview of that particular topic. That said, the overall quality of the instruction and assignments in this course are top notch and I'd highly recommend parts 1 and 2 to anyone looking for a solid foundation in algorithm design and analysis.

3 years ago
**completed** this course.

I took similar courses in university for my Master of Science. But it was many years ago, few graph algorithms were completely new to me. Quite challenging assignments will take a bit of your free time. Overall, it was nice to feel like a student again.

2 years ago
**completed** this course.

Very good course, just like part I. This course seemed much harder than part I, but it was still doable. Prof Roughgarden does a very good job teaching the material.

2 years ago
**completed** this course.

Prof. Roughgarden is unbelievable professional. He does amazing job.

a year ago
**partially completed** this course, spending **7 hours** a week on it and found the course difficulty to be **very hard**.

6 months ago