Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Online Course

Algorithms: Design and Analysis, Part 2

Stanford University via Coursera

(19)
811
  • Provider Coursera
  • Cost Free Online Course (Audit)
  • Session Finished
  • Language English
  • Certificate Paid Certificate Available
  • Effort 6-10 hours a week
  • Duration 7 weeks long
  • Learn more about MOOCs

Taken this course? Share your experience with other students. Write review

Overview

Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This course is an introduction to algorithms for learners with at least a little programming experience. The course is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this course, you will have a greater mastery of algorithms than almost anyone without a graduate degree in the subject.

Specific topics in Part 2 include: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes), dynamic programming (knapsack, sequence alignment, optimal search trees, shortest paths), NP-completeness and what it means for the algorithm designer, analysis of heuristics, local search.

About the instructor: Tim Roughgarden has been a professor in the Computer Science Department at Stanford University since 2004. He has taught and published extensively on the subject of algorithms and their applications.

Note: this course is closing on October 10th, 2016, and relaunching as part of a specialization: https://www.coursera.org/specializations/algorithms

Syllabus

Week 1
Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm.

Week 2
Kruskal's MST algorithm and applications to clustering; advanced union-find (optional); Huffman codes.

Week 3
Dynamic programming: introduction, the knapsack problem, sequence alignment, and optimal binary search trees.

Week 4
The Bellman-Ford algorithm; all-pairs shortest paths.

Week 5
NP-complete problems and exact algorithms for them.

Week 6
Approximation and local search algorithms for NP-complete problems; the wider world of algorithms.

Final Exam
Final exam (1 attempt per 24 hours)

Taught by

Tim Roughgarden

Help Center

Most commonly asked questions about Coursera

Reviews for Coursera's Algorithms: Design and Analysis, Part 2 Based on 19 reviews

  • 5 stars 74%
  • 4 stars 26%
  • 3 star 0%
  • 2 star 0%
  • 1 star 0%

Did you take this course? Share your experience with other students.

Write a review
  • 1
Luiz C
Luiz completed this course, spending 10 hours a week on it and found the course difficulty to be hard.
In my top 3 MOOC.

Great content and delivery by Prof. Roughgarden on a rather dry topic.

The videos are great quality.

The assignments are very challenging but interesting.

I just wished this MOOC would be longer
Was this review helpful to you? Yes
Life S
Life 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 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 langua…
Read Full Review
5 people found
this review helpful
Was this review helpful to you? Yes
Anonymous
Anonymous 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.
1 person found
this review helpful
Was this review helpful to you? Yes
Anonymous
Anonymous 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.
Was this review helpful to you? Yes
Anonymous
Anonymous completed this course.
Prof. Roughgarden is unbelievable professional. He does amazing job.
Was this review helpful to you? Yes
Ilya R
by Ilya completed this course.
Was this review helpful to you? Yes
Marta M
Marta completed this course, spending 7 hours a week on it and found the course difficulty to be very hard.
Was this review helpful to you? Yes
Rey C
by Rey completed this course.
Was this review helpful to you? Yes
Tabish S
by Tabish completed this course.
Was this review helpful to you? Yes
Colin K
by Colin completed this course.
Was this review helpful to you? Yes
Mohammed E
by Mohammed completed this course.
Was this review helpful to you? Yes
Rafael P
Rafael completed this course.
Was this review helpful to you? Yes
You-cyuan J
by You-cyuan completed this course, spending 10 hours a week on it and found the course difficulty to be hard.
Was this review helpful to you? Yes
Dmitry K
Dmitry completed this course.
Was this review helpful to you? Yes
Valentin K
by Valentin completed this course.
Was this review helpful to you? Yes
Gregory D
by Gregory completed this course.
Was this review helpful to you? Yes
Anonymous
Anonymous completed this course.
Was this review helpful to you? Yes
Mark B
by Mark completed this course.
Was this review helpful to you? Yes
  • 1

Class Central

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free

Never stop learning Never Stop Learning!

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free