CSE 431 : Algorithms Analysis And Design

Credits: 4
Semester: F SP
Prerequisites: CSE 331, MTH 142
Corequisites: None
Type: LEC/REC

Introduces basic elements of the design and analysis of algorithms. Topics include asymptotic notations and analysis, divide and conquer, greedy algorithms, dynamic programming, fundamental graph algorithms, NP-completeness, approximation algorithms, and network flows. For each topic, beside in-depth coverage, we discuss one or more representative problems and their algorithms. In addition to the design and analysis of algorithms, students are expected to gain substantial discrete mathematics problem solving skills essential for computer scientists and engineers.

Class Schedule: Fall 2009

4 Course(s)
Reg #
Course
Title
Section
Type
Days
Time
Room
Location
Instructor
Status
377639 CSE 431 Algorithms Anal & Dsgn 1 R 1 REC M 8:00 AM - 8:50 AM 260 CAPEN North Staff Closed
135240 CSE 431 Algorithms Anal & Dsgn 1 R 2 REC W 9:00 AM - 9:50 AM 106 TALBRT North Staff Closed
060488 CSE 431 Algorithms Anal & Dsgn 1 R 3 REC F 8:00 AM - 8:50 AM 138 BELL North Staff Closed
<<< >>> CSE 431 Algorithms Anal & Dsgn 1 LEC T R 6:30 PM - 7:50 PM 109 KNOX North He, X Closed


Class Schedule: Spring 2010

4 Course(s)
Reg #
Course
Title
Section
Type
Days
Time
Room
Location
Instructor
Status
045730 CSE 431 Algorithms Anal & Dsgn 1 R 1 REC M 3:00 PM - 3:50 PM 209 NORTON North Staff Open
172483 CSE 431 Algorithms Anal & Dsgn 1 R 2 REC M 11:00 AM - 11:50 AM 250 PARK North Staff Open
364430 CSE 431 Algorithms Anal & Dsgn 1 R 3 REC R 8:00 AM - 8:50 AM 258 CAPEN North Staff Open
<<< >>> CSE 431 Algorithms Anal & Dsgn 1 LEC M W F 12:00 PM - 12:50 PM 107 TALBRT North Miller, R Open

Last Updated: Nov 24, 2009 9:06:06 AM