CS 473

Spring 2015 All Classes

All Classes

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 2015
CRN	Type	Section	Time	Day	Location	Instructor	Section Details
48274	Discussion/ Recitation	AD1	4:00PM -4:50PM	R	1214 Siebel Center for Comp Sci	Har-Peled, S	Part of Term: 1 Date Range: 01/20/15-05/06/15
48277	Discussion/ Recitation	AD4	5:00PM -5:50PM	R	1214 Siebel Center for Comp Sci	Har-Peled, S	Part of Term: 1 Date Range: 01/20/15-05/06/15
31457	Lecture	AL1	12:30PM -1:45PM	TR	1310 Digital Computer Laboratory	Har-Peled, S	Part of Term: 1 Date Range: 01/20/15-05/06/15 Credit: 3 hours Section Info: This course is intended for students who have taken CS 373 and are required to take an algorithms course. Students who have taken CS 374 (currently CS 498 section B) who would like a follow-on algorithms course should register for CS 498 Section D) Restriction(s): Restricted to Computer Science or Statistics & Computer Science or Math & Computer Science or Computer Sci & Anthropology or Computer Sci & Astronomy or Computer Sci & Chemistry or Computer Sci & Linguistics major(s).