Spring Quarter '01-'02

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

To sign up for the class, see the announcements page. To contact the teaching staff, send e-mail to cs161-help@cs.stanford.edu.

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

Last update: May 8, 2002