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

Note on Course Availability

This course is typically offered Winter and Summer quarters.

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 certificate homepage.

066 Summer 2019-20 Online

Enroll Now

Dates:June 22 - August 13, 2020
Units: 3.00-5.00
Instructors: Karey Shi
Delivery Option:
Online
Fees:
For Credit $3,900.00-$6,500.00
Notes: Enrollment Dates: April 30 to June 15, 2020 at 5:00PM PST

Computer Science Department Requirement
Students taking graduate courses in Computer Science must enroll for the maximum number of units and maintain a B or better in each course in order to continue taking courses under the Non Degree Option.

This course may not currently be available to learners in some states and territories.