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 Information
CRN	Type	Section	Time	Days	Location	Instructor
48274	discussion- recitation	AD1	10:00 AM - 10:50 AM	R	room 1111 Siebel Center for Comp Sci	Viswanathan, M
48275	discussion- recitation	AD2	11:00 AM - 11:50 AM	R	room 1111 Siebel Center for Comp Sci	Viswanathan, M
48276	discussion- recitation	AD3	03:00 PM - 03:50 PM	R	room 1111 Siebel Center for Comp Sci	Viswanathan, M
48277	discussion- recitation	AD4	04:00 PM - 04:50 PM	R	room 1111 Siebel Center for Comp Sci	Viswanathan, M
31457	lecture	AL1	11:00 AM - 12:15 PM	WF	room 1310 Digital Computer Laboratory	Viswanathan, M
3 hours This section is for UNDERGRADUATE students. NO GRADUATE section of CS 473 will be offered in the spring semester, 2008.

View schedules for

CS 473Algorithms

CS 473
Algorithms