Course overview

Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This specialization is an introduction to algorithms for learners with at least a little programming experience. The specialization is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this specialization, you will have a greater mastery of algorithms than almost anyone without a graduate degree in the subject. Specific topics in Part 3 of the specialization include: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees).

Resources

• Mathematics for Computer Science (by Eric Lehman and Tom Leighton): https://www.cs.princeton.edu/courses/archive/fall06/cos341/handouts/mathcs.pdf

Course Policies

Video Lectures

• Lectures will be made available weekly, for a total of four weeks. In a given week, there will generally be two hours of required material, plus additional optional material (some review, some advanced topics).

• Below each lecture video there is a PDF of typed versions of the slides.

• You can download the videos of the lectures for offline viewing.

• The video player supports speeding up and slowing down the pace.

Weekly Programming Assignments and Problem Sets

• Each week there will be a new problem set and a new programming assignment.

• For each problem set you are allowed a maximum of two attempts in a 12-hour period (we'll use the best score).

• For each programming assignment you're allowed a maximum of 10 attempts in a 12-hour period (we'll use the best score).

• For the final exam, you're allowed one attempt per 24 hours.

Grading

• To pass a problem set, you must get at least 4 of the 5 questions correct (80%).

• To pass a programming assignment, you must get all of the answers correct (100%).

• To pass the final exam, you must get at least 70% of the total points (14 out of 20).

• To pass the course, you must pass all of the problem sets, all of the programming assignments, and the final exam.

Theory Problems

• These are totally optional theory questions (no deadlines or credit given).

• We encourage you to attempt these questions and discuss them in the forums to develop a deeper understanding of the design and analysis of algorithms.