CS 161: 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. Prerequisite: 106B or 106X; 103 or 103B; 109 or
STATS 116.
Terms: Aut, Win, Sum
| Units: 3-5
| UG Reqs: GER:DB-EngrAppSci, WAY-FR
Instructors:
Anari, N. (PI)
;
Charikar, M. (PI)
;
Rubinstein, A. (PI)
...
more instructors for CS 161 »
Instructors:
Anari, N. (PI)
;
Charikar, M. (PI)
;
Rubinstein, A. (PI)
;
Sotoudeh, M. (PI)
;
Conkey, A. (TA)
;
Cussen, H. (TA)
;
Dixit, A. (TA)
;
Garg, R. (TA)
;
Goyal, S. (TA)
;
Hosgur, E. (TA)
;
Ko, J. (TA)
;
Kolichala, P. (TA)
;
Li, W. (TA)
;
Liu, S. (TA)
;
Mayer, T. (TA)
;
Namboothiry, B. (TA)
;
Parada, R. (TA)
;
Patterson, K. (TA)
;
Rivkin, J. (TA)
;
Roghani, M. (TA)
;
Salahi, K. (TA)
;
Singh, A. (TA)
;
Singhal, A. (TA)
;
Stearns, C. (TA)
;
Wang, X. (TA)
;
Z. HaoChen, J. (TA)
;
Zhang, P. (TA)
;
Zhao, J. (TA)
Filter Results: