CS 473

Spring 2009 Part of Term 1

Part of Term 1
Jan 20-May 6

Algorithms

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 373.

Students must register for a lecture and a discussion section.

My Favorites

My Schedule

Section Status updates every 10 minutes.

CS 473 class schedule data for spring 2009
CRN	Type	Section	Time	Day	Location	Instructor	Section Details
48274	Discussion/ Recitation	AD1	5:00PM -5:50PM	T	1111 Siebel Center for Comp Sci	Erickson, J Moseley, B Nayyeri, A Ene, A	Part of Term: 1 Date Range: 01/20/09-05/06/09
48275	Discussion/ Recitation	AD2	6:00PM -6:50PM	T	1111 Siebel Center for Comp Sci	Erickson, J Moseley, B Nayyeri, A Ene, A	Part of Term: 1 Date Range: 01/20/09-05/06/09
48276	Discussion/ Recitation	AD3	2:00PM -2:50PM	W	1111 Siebel Center for Comp Sci	Erickson, J Moseley, B Nayyeri, A Ene, A	Part of Term: 1 Date Range: 01/20/09-05/06/09
48277	Discussion/ Recitation	AD4	3:00PM -3:50PM	W	1111 Siebel Center for Comp Sci	Erickson, J Moseley, B Nayyeri, A Ene, A	Part of Term: 1 Date Range: 01/20/09-05/06/09
31457	Lecture	AL1	11:00AM -12:15PM	TR	1404 Siebel Center for Comp Sci	Erickson, J	Part of Term: 1 Date Range: 01/20/09-05/06/09 Credit: 3 hours Section Info: This section is for UNDERGRADUATE students. NO GRADUATE section of CS 473 will be offered. Restriction(s): Restricted to Undergrad - Urbana-Champaign.