Winter Quarter 2017-18

Quick News:

Professor Guibas' office hours for Tuesday, March 6, will be 2:30-3:30 pm in his office, not 1:30-2:30 pm.

The class meets MW 3:00 -- 4:20 pm in the NVIDIA Auditorium. There are six recitation sections -- details here.

The lectures are recorded and are available through SCPD to qualified viewers.

Recitation F is now (from 1/26) Friday, 4:30 -- 5:20 pm in Thornton 102 (and broadcast via SCPD)

Be sure to read the CS161 homework policies.

CS161 covers in depth fundamental data structures and techniques for discrete algorithm design and analysis. Specific topics to be covered include:

• Algorithm analysis; worst and average case
• Recurrences and asymptotics
• Algorithms for sorting and selection
• Randomized techniques
• Search structures: heaps, balanced trees, skip lists, hash tables
• Dynamic programming and greedy algorithms
• Amortized analysis
• Graph algorithms: breadth- and depth-first search, MSTs, shortest paths
• Network flows

The course textbook is Introduction to Algorithms, Third Edition, by T. Cormen, C. Leiserson, R. Rivest, and C. Stein, MIT Press, 2009.

The class involves:

• six weekly homeworks
• a programming project
• an in-class closed-book midterm
• no final

In addition to the lectures and office hours, three recitation sections are available to further elaborate on the material covered.

We will use Piazza as the on-line forum for questions and discussion of the course material.

These pages are maintained by Leonidas Guibas guibas@cs.stanford.edu.

Last update: February 18, 2018.