Design and Analysis of Algorithms

CS161

Stanford School of Engineering


Description

Algorithms are essential to the study of computer science and are increasingly important in the natural sciences, social sciences and industry. Learn how to effectively construct and apply techniques for analyzing algorithms including sorting, searching, and selection. Gain an understanding of algorithm design technique and work on algorithms for fundamental graph problems including depth-first search, worst and average case analysis, connected components, and shortest paths.

Prerequisites

CS103CS109 or STATS116

Topics include

  • Recurrences and asymptotics
  • Divide-and-conquer, dynamic programming, randomization
  • Sequence alignment
  • Minimum-cost spanning tree
  • Topological sort
  • Data structures

Course Availability

The course schedule is displayed for planning purposes – courses can be modified, changed, or cancelled. Course availability will be considered finalized on the first day of open enrollment. For quarterly enrollment dates, please refer to our graduate education section.

Thank you for your interest. The course you have selected is not open for enrollment. Please click the button below to receive an email when the course becomes available again.

Request Information