Skip to main content
Help

Algorithms: Design and Analysis, Part 2

About This Course

Welcome to the self paced course, Algorithms: Design and Analysis, Part 2! 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.

Learners will practice and master the fundamentals of algorithms through several types of assessments. There are 6 multiple-choice problem sets to test your understanding of the most important concepts. There are also 6 programming assignments, where you implement one of the algorithms covered in lecture in a programming language of your choosing. The course concludes with a multiple-choice final.

There are no assignment due dates and you can work through the course materials and assignments at your own pace.

Who This Course is For:

This course is aimed at learners with at least a little bit of programming experience who want to learn the essentials of algorithms. In a University computer science curriculum, this course is typically taken in the third year.

Course Staff

Picture of Tim Roughgarden

Tim Roughgarden

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.

Frequently Asked Questions

Can I earn a Statement of Accomplishment

Yes. If you successfully complete at least 70% of the graded assignments in the course, you can receive a Statement of Accomplishment.

  1. Course Number

    Algorithms2
  2. Classes Start

    Sep 05, 2017
  3. Estimated Effort

    4 hrs / wk
  4. Price

    Free

Our Research Community

Stanford University pursues the science of learning. Online learners are important participants in that pursuit. The information we gather from your engagement with our instructional offerings makes it possible for faculty, researchers, designers and engineers to continuously improve their work and, in that process, build learning science.

By registering as an online learner, you are also participating in research...

Read Terms of Service and Privacy Policy.

Enroll