[ Course Schedule | Midterm and Final | Homework Assignments | Recitations | Resources ]
Instructor: Gregory Valiant (email: gvaliant at cs)
Location and time: Monday and Wednesday 3:00 PM - 4:20 PM, NVIDIA Auditorium
Sign up on Piazza for discussions and announcements.
We strongly encourage discussion and asking questions on Piazza. Questions to the course staff (that are not addressed to a specific person) can be sent using a private post in Piazza.
This course will cover the basic approaches and mindsets for analyzing and designing algorithms and data structures. Topics include the following: Worst and average case analysis. Recurrences and asymptotics. Efficient algorithms for sorting, searching, and selection. Data structures: binary search trees, heaps, hash tables. Algorithm design techniques: divide-and-conquer, dynamic programming, greedy algorithms, amortized analysis, randomization. Algorithms for fundamental graph problems: minimum-cost spanning tree, connected components, topological sort, and shortest paths. Possible additional topics: network flow, string searching.
Prerequisites: CS 103 or CS 103B; CS 109 or STATS 116.
Requirements: 7 homework assignments (35%), a midterm (25%), and a final exam (40%). We will drop your lowest homework grade.
Luna Frank-Fischer [Head TA], luna16 at stanford
Dilsher Ahmed, dilsher at stanford
Michael Chen, mchen36 at stanford
Ashok Cutkosky, ashokc at stanford
Shloka Desai, shloka at stanford
David Eng, dkeng at stanford
Julien Kawawa-Beaudan, julienkb at stanford
Sam Kim, samhykim at stanford
Maxime Voisin, maximev at stanford
Daniel Wright, dlwright at stanford
Jimmy Wu, jimmyjwu at stanford
Andi Yang, andiy at stanford
Wilbur Yang, wilbury at stanford
Topics and readings for future lectures are tentative and may be changed as the course proceeds. The readings refer to the 3rd edition of CLRS (see Resources below), but older editions should be fine as well.
Introduction, Why are you here?
Read: Ch. 1
MergeSort, Recurrences, Asymptotics
Read: Ch. 2.3, 3
Homework 1 released
MLK Day (no classes)
Integer Multiplication, Solving Recurrences
Read: Ch. 4.3-4.5
Dasgupta-Papadimitriou-Vazirani Sec. 2.2: [pdf]
Homework 1 due
Homework 2 released
Median and Selection
Read: Ch. 9
Quicksort, Probability and Randomized Algorithms
Read: Ch. 7, 5
Homework 2 due
Homework 3 released
Sorting Lower Bounds, Counting Sort
Read: Ch. 8.1-2
Avrim Blum's Notes on sorting lower bounds
Notes on Bucket Sort and Radix Sort (draft)
Binary Search Trees
Read: Ch. 12
Homework 3 due
Homework 4 released
Read: Ch. 11
Graphs, DFS, BFS
Read: Ch. 22, 24
Homework 4 due
Homework 5 released
Strongly Connected Components
Read: Ch. 24, 6
Dijkstra's Algorithm, Amortized Analysis, Bellman-Ford Algorithm
Read: Ch. 24.1, 24.3
Homework 5 due
President's Day (no class)
MIDTERM (CEMEX Auditorium)
Dynamic Programming: Floyd-Warshall, Longest Common Subsequence
Read: Ch. 25.2, 15.4
Chain Matrix Multiplication, Knapsack, Independent Set
Homework 6 released
Read: Ch. 16
Minimum Spanning Trees (MST)
Read: Ch. 23
Homework 6 due
Homework 7 released
Minimum Cut/Maximum Flow
Notes. Read: Ch. 26.1-3
Homework 7 due
Final Exam, 3:30pm-6:30pm CEMEX.
Midterm: Wednesday, February 22, in class, 3:00 pm - 4:20 pm
Final: Monday, March 20, 3:30-6:30pm.
Both the midterm and final are closed-book. In the midterm, you are allowed to bring one letter-sized double-sided page of notes, that YOU have prepared YOURSELF. In the final, you are allowed to bring two letter-sized double-sided page of notes (that you have prepared yourself).
The following practice exams are posted here as a resource; the material covered is similar to what we covered this quarter, but not identical.
Practice Midterm 1
Solutions to the Practice Midterm 1
Practice Midterm 2 (new)
Solutions to the Practice Midterm 2 (new)
The following final exams are taken from previous offerings of the class. They are posted here as a resource, but the material covered in them may differ what the material covered this quarter, and their structure may differ from this quarter's final exam.
Final Exam 2016
Final Exam 2016 Solutions
We hold recitation sections in order to review some of the material and solve additional exercises with the students in smaller groups. The sections are optional but highly recommended. The schedule (including locations) of the recitation sections appears in the office hours calendar. Each section covers the material of the previous week except for Friday sections that cover the material of the same week.
The main textbook we use is:
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, Introduction to Algorithms, 3rd Edition, MIT Press
The book is available online through the Stanford library.
We will also occasionally use:
Jon Kleinberg, Éva Tardos, Algorithm Design, Pearson/Addison-Wesley
Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani, Algorithms, McGraw-Hill Education
We strongly recommend typesetting solutions to the homework assignments using LaTeX. LaTeX provides a convenient way to produce high-quality documents and it is the standard used for typesetting computer science papers.
Online environments: If you do not wish to install LaTeX, ShareLaTeX and Overleaf are online environments that compile previews of your documents as you type and allow you to share documents with collaborators (this feature won't be useful in this course, though). As a Stanford student, you get a free Overleaf Pro account.
LyX: LyX is a version of LaTeX with graphical interface.