CS 473

Spring 2012 Part of Term 1

Part of Term 1
Jan 17-May 2

Fundamental Algorithms

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.

My Favorites

My Schedule

Section Status updates every 10 minutes.

CS 473 class schedule data for spring 2012
CRN	Type	Section	Time	Day	Location	Instructor	Section Details
48274	Discussion/ Recitation	AD1	5:00PM -5:50PM	T	Siebel Center for Comp Sci	Chekuri, C	Part of Term: 1 Date Range: 01/17/12-05/02/12
48275	Discussion/ Recitation	AD2	6:00PM -6:50PM	T	Siebel Center for Comp Sci	Chekuri, C	Part of Term: 1 Date Range: 01/17/12-05/02/12
48276	Discussion/ Recitation	AD3	4:00PM -4:50PM	W	Siebel Center for Comp Sci	Chekuri, C	Part of Term: 1 Date Range: 01/17/12-05/02/12
48277	Discussion/ Recitation	AD4	5:00PM -5:50PM	W	Siebel Center for Comp Sci	Chekuri, C	Part of Term: 1 Date Range: 01/17/12-05/02/12
31457	Lecture	AL1	11:00AM -12:15PM	TR	Siebel Center for Comp Sci	Chekuri, C	Part of Term: 1 Date Range: 01/17/12-05/02/12 Credit: 3 hours