cs161_cover.jpg

 

 

 

 

 

Winter Quarter '99-'00


CS161 covers in depth fundamental data structures and techniques for 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 contact the teaching staff, send e-mail to cs161-help@cs.stanford.edu.

Please join the mailing list cs161-students@lists.stanford.edu to receive announcements about the class.

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

Last update January 16, 2000