CS 473
Fall 2005 Part of Term 1
Part of Term 1
Aug 24-Dec 9
Aug 24-Dec 9
Credit: 3 OR 4 hours.
(C S 373) 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; or consent of instructor.
Section Status updates every 10 minutes.
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
35846
|
Lecture-Discussion
|
G3
|
12:30PM
-1:45PM
|
TR
|
Digital Computer Laboratory
|
Erickson, J
|
|
|
|
35859
|
Lecture-Discussion
|
G4
|
12:30PM
-1:45PM
|
TR
|
Digital Computer Laboratory
|
Erickson, J
|
|
|
|
43365
|
Lecture-Discussion
|
UG3
|
11:00AM
-12:15PM
|
TR
|
Siebel Center for Comp Sci
|
Pitt, L
|
|