The Student Services team will have office hours at Harmony House (561 Lomita Dr, Stanford, CA 94305) on Tuesday and Thursday from 10 a.m. to 4 p.m.
Design and Analysis of Algorithms
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, amortized analysis, randomization. Algorithms for fundamental graph problems: minimum-cost spanning tree, connected components, topological sort, and shortest paths. Possible additional topics: network flow, string searching.
Details:
- Catalog Number
- CS 161-01
- Class Number
- 15470
- Course Cost
- $6860.00
- Population
- Undergraduate, Graduate
- Units
- 5
- Interest Area
- Computer Science and Engineering
- Course Format & Length
- In-Person, 8 weeks
- Instructors
- Hosgur, E., Ivkov, M.
- Dates
- -
- Prerequisites
-
CS 106B or CS 106X; CS 103 or CS 103B; CS 109 or STATS 116.
- Schedule
- Mon, Wed, Fri 10:30 AM - 12:15 PM
- Course Notes
-
May be taken for 3 or 4 units by Stanford grad students.