Skip to main content.

Courses

Subjects

Course Search

Search Results

Course Prefix: CSE   Course #: 431   Keywords: null   showing 1 to 1 of ~1

CSE 431LEC Algorithms Analysis and Design

Lecture

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: 3
Grading: Graded (GRD)
Typically Offered: Fall, Spring
Prerequisites: CSE 331. Approved Computer Science, Computer Engineering, Bioinformatics/CS Majors Only. Students must complete a mandatory advisement session with their faculty advisor.
 
Published: Dec 06, 2019 16:43:01