EdusalsaDiscover Your Stanford

CS 161

Design and Analysis of Algorithms

  • autumn
  • winter
  • summer
  • 2021-2022

3 - 5 units

Letter or Credit/No Credit

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, randomization. Algorithms for fundamental graph problems: minimum-cost spanning tree, connected components, topological sort, and shortest paths. Possible additional topics: network flow, string searching, amortized analysis, stable matchings and approximation algorithms. Prerequisite: 103 or 103B; 109 or STATS 116.

Fulfills

  • GER:DB-EngrAppSci

  • WAY-FR

Course Prequisites

Sections

  • DIS

    • -

      This class section has been cancelled!

    • -

    • Wednesday 11:00:00 AM - 1:00:00 PM @ 160-315

    • Wednesday 1:30:00 PM - 3:30:00 PM @ 60-107

    • Wednesday 4:00:00 PM - 6:00:00 PM @ 160-323

    • Wednesday 8:30:00 AM - 10:30:00 AM @ 80-115

  • LEC

    • Tuesday Thursday 1:30:00 PM - 3:00:00 PM @ Hewlett Teaching Center 200 with Aviad Rubinstein

      Graduate students may take for 3 units.

  • LEC

Grade Distribution

Sign Up

To save CS 161 to your course bucketlist

Already Have An Account? Log In