Design and Analysis of Algorithms
COMPSCI 161 (4.0
units) –
10 Week
Techniques for efficient algorithm design, including divide-and-conquer and dynamic programming, and time/space analysis. Fast algorithms for problems applicable to networks, computer games, and scientific computing, such as sorting, shortest paths, minimum spanning trees, network flow, and pattern matching. Prerequisite: (I&C SCI 46 or CSE 46) and I&C SCI 6B and I&C SCI 6D and MATH 2B. I&C SCI 46 with a grade of C or better. CSE 46 with a grade of C or better
| Instructor(s) |
Fukuzawa, S.
|
| Schedule |
MWF 11:00 - 11:50am, Social Science Laboratory 140
|
| Units |
4.0 |
| Course Code |
34110 |
| Fees |
|
UC Undergraduate (per unit) |
$ 279.00
|
|
UC Graduate (per unit) |
$ 374.00
|
|
Visitor (per unit) |
$ 374.00
|
|
| Note(s) |
None |