CS 473
Fall 2014 Part of Term 1
Aug 25-Dec 10
Credit: 0 TO 4 hours.
Fundamental techniques for algorithm design and analysis, including recursion, dynamic programming, randomization, dynamic data structures, fundamental graph algorithms, and NP-completeness. Intended for undergraduates in Computer Science and graduate students in other departments.
Same as CSE 414 and MATH 473. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 373.
Students must register for a lecture and a discussion section.
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
51491
|
Discussion/
Recitation |
AD1
|
4:00PM
-4:50PM
|
T
|
Siebel Center for Comp Sci
|
Kolla, A
|
|
|
|
51492
|
Discussion/
Recitation |
AD2
|
5:00PM
-5:50PM
|
T
|
Siebel Center for Comp Sci
|
Kolla, A
|
|
|
|
51493
|
Discussion/
Recitation |
AD3
|
2:00PM
-2:50PM
|
W
|
Siebel Center for Comp Sci
|
Kolla, A
|
|
|
|
51494
|
Discussion/
Recitation |
AD4
|
3:00PM
-3:50PM
|
W
|
Siebel Center for Comp Sci
|
Kolla, A
|
|
|
|
56046
|
Discussion/
Recitation |
AD5
|
5:00PM
-5:50PM
|
W
|
Siebel Center for Comp Sci
|
Kolla, A
|
|
|
|
43365
|
Lecture-Discussion
|
AE1
|
11:00AM
-12:15PM
|
TR
|
Siebel Center for Comp Sci
|
Kolla, A
|
|
|
|
35859
|
Lecture-Discussion
|
AE2
|
11:00AM
-12:15PM
|
TR
|
Siebel Center for Comp Sci
|
Kolla, A
|
|