Design and Analysis of Algorithms
Fee may apply
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.
- Reyna Hulett
- Recurrences and asymptotics
- Divide-and-conquer, dynamic programming, randomization
- Sequence alignment
- Minimum-cost spanning tree
- Topological sort
- Data structures
Note on 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 certificate homepage.
|Dates:||June 25 - August 15, 2019|
|Times:||9:30 am - 11:20 am|
Provides Stanford University credit that may later be applied towards a graduate degree or certificate. Includes access to online course materials and videos for the duration of the academic quarter. Starting Autumn 2016 there is a $100 fee per course for courses dropped before the drop deadline. Click here for more information about our Registration Policies.
NotesEnrollment Dates: April 14 to June 17, 2019
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 residents of certain states.