CS 473
Spring 2008 Part of Term 1
Part of Term 1
Jan 14-Apr 30
Jan 14-Apr 30
Credit: 0 TO 4 hours.
Advanced data structures, graph algorithms, arithmetic algorithms, geometric algorithms, string problems, parallel algorithms, NP-completeness.
Same as CSE 414 and MATH 473. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 225 and CS 273.
Students must register for a lecture and a discussion section.
Section Status updates every 10 minutes.
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
48274
|
Discussion/
Recitation |
AD1
|
10:00AM
-10:50AM
|
R
|
Siebel Center for Comp Sci
|
Viswanathan, M
|
|
|
|
48275
|
Discussion/
Recitation |
AD2
|
11:00AM
-11:50AM
|
R
|
Siebel Center for Comp Sci
|
Viswanathan, M
|
|
|
|
48276
|
Discussion/
Recitation |
AD3
|
3:00PM
-3:50PM
|
R
|
Siebel Center for Comp Sci
|
Viswanathan, M
|
|
|
|
48277
|
Discussion/
Recitation |
AD4
|
4:00PM
-4:50PM
|
R
|
Siebel Center for Comp Sci
|
Viswanathan, M
|
|
|
|
31457
|
Lecture
|
AL1
|
11:00AM
-12:15PM
|
WF
|
Digital Computer Laboratory
|
Viswanathan, M
|
|