Undergraduate Degree & Course Catalog

Help & Advanced Search Features

Tips & Tricks

Course Search

CSE 431LR Algorithms Anal & Dsgn 1
Computer Science & Engineering

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.

Credits: 4
Semester(s) Typically Offered: Fall, Spring
Grading: Graded (GRD)
Pre-Requisites: CSE 331 Approved Computer Science, Computer Engineering, Bioinformatics/CS Majors Only

Reg # Alt Title Section Dates Days Time Type Instructor
{{course | enrollmentAllowedFltr}} {{course | altTitleFltr}} {{course.section}} {{course.start.date | date:'MMM d'}} - {{course.end.date | date:'MMM d'}} {{course.when[0].pattern}} {{course.start.time | military2RegularFltr}} - {{course.end.time | military2RegularFltr}} {{course.catalog.type_pk}} {{course.instructor}}
No classes scheduled for this course during the {{rsC.scheduleErrors[0]}} semester.