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, Spr, Sum
| Units: 3-5
| UG Reqs: GER:DB-EngrAppSci, WAY-FR
Instructors:
Anari, N. (PI)
;
Charikar, M. (PI)
;
Hosgur, E. (PI)
;
Ivkov, M. (PI)
;
Rubinstein, A. (PI)
;
Wootters, M. (PI)
;
Agarwal, R. (TA)
;
Agrawal, A. (TA)
;
Burgess, C. (TA)
;
Chen, J. (TA)
;
Correa Dias Godoy, F. (TA)
;
Dixit, A. (TA)
;
Dong, W. (TA)
;
Frager, T. (TA)
;
Garg, R. (TA)
;
Goyal, S. (TA)
;
Hu, J. (TA)
;
Hugh, G. (TA)
;
Ido, Y. (TA)
;
Ivkov, M. (TA)
;
Jain, S. (TA)
;
Khandelwal, B. (TA)
;
Korkmaz, E. (TA)
;
Liu, Z. (TA)
;
Lu, L. (TA)
;
Namboothiry, B. (TA)
;
Nangi, S. (TA)
;
Oyeniyi, T. (TA)
;
Palaparthi, A. (TA)
;
Parada, R. (TA)
;
Sanchez, S. (TA)
;
Saue- Fletcher, L. (TA)
;
Sengupta, A. (TA)
;
Su, K. (TA)
;
Thompson, R. (TA)
;
Tran, H. (TA)
;
Velu, A. (TA)
;
Verma, T. (TA)
;
Villa-Renteria, I. (TA)
;
Wan, K. (TA)
;
Wang, A. (TA)
;
Wang, R. (TA)
;
Xu, M. (TA)
;
Yang, C. (TA)
;
Z. HaoChen, J. (TA)
;
Zhu, M. (TA)
CS 261: Optimization and Algorithmic Paradigms
Algorithms for network optimization: max-flow, min-cost flow, matching, assignment, and min-cut problems. Introduction to linear programming. Use of LP duality for design and analysis of algorithms. Approximation algorithms for NP-complete problems such as Steiner Trees, Traveling Salesman, and scheduling problems. Randomized algorithms. Introduction to sub-linear algorithms and decision making under uncertainty. Prerequisite: 161 or equivalent.
Terms: Win
| Units: 3
Filter Results: