CS 473
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.

Section Information
CRN	Type	Section	Time	Days	Location	Instructor
51491	discussion- recitation	AD1	05:00 PM - 05:50 PM	T	room 1111 Siebel Center for Comp Sci	Chekuri, C
51492	discussion- recitation	AD2	06:00 PM - 06:50 PM	T	room 1111 Siebel Center for Comp Sci	Chekuri, C
51493	discussion- recitation	AD3	02:00 PM - 02:50 PM	W	room 1111 Siebel Center for Comp Sci	Chekuri, C
51494	discussion- recitation	AD4	03:00 PM - 03:50 PM	W	room 1111 Siebel Center for Comp Sci	Chekuri, C
43365	lecture- discussion	AL1	11:00 AM - 12:15 PM	TR	room 1404 Siebel Center for Comp Sci	Chekuri, C
3 hours This course is for UNDERGRADUATE students, only.

View schedules for

CS 473Algorithms

CS 473
Algorithms