CS 473
Fall 2024 All Classes
All Classes
Credit: 4 hours.
Design and analysis techniques, approximation algorithms, randomized algorithms and amortized analysis, and advanced topics such as network flow, linear programming, and dynamic data structures, among others.
Same as CSE 414 and MATH 473. 4 undergraduate hours. 4 graduate hours. Prerequisite: CS 374 or ECE 374, and one of CS 361, STAT 361, ECE 313, MATH 362, MATH 461, MATH 463 or STAT 400.
Section Status updates every 10 minutes.
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
51491
|
Discussion/
Recitation
Online
|
CSP
CSP
|
ARRANGED
ARRANGED
|
n.a.
n.a.
|
Location Pending
n.a.
|
Sinha, M
Sinha, M
|
|
|
|
51492
|
Discussion/
Recitation
Online
|
MCS
MCS
|
ARRANGED
ARRANGED
|
n.a.
n.a.
|
Location Pending
n.a.
|
Sinha, M
Sinha, M
|
|
|
|
70159
|
Lecture-Discussion
|
S4
|
2:00PM
-3:15PM
|
TR
|
Loomis Laboratory
|
Erickson, J
Sinha, M |
|
|
|
72165
|
Lecture-Discussion
|
S4G
|
2:00PM
-3:15PM
|
TR
|
Loomis Laboratory
|
Erickson, J
Sinha, M |
|