Courses
Course Search
Search Results
Course Prefix:
CSE
Course #:
431
Keywords:
null
showing 1 to 1 of ~1
CSE 431LR Algorithms Analysis and Design
LectureIntroduces 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
Grading: Graded (GRD)
Typically Offered: Fall, Spring
Prerequisites: CSE 331 Approved Computer Science, Computer Engineering, Bioinformatics/CS Majors Only
Grading: Graded (GRD)
Typically Offered: Fall, Spring
Prerequisites: CSE 331 Approved Computer Science, Computer Engineering, Bioinformatics/CS Majors Only
Subjects
| Course Prefix | Subject Description | # Courses | |
|---|---|---|---|
| UGRD | GRAD | ||
| {{subject.properties.abbr}} | {{subject | AltNameFltr}} | {{subject.properties.courses.ugrd}} | {{subject.properties.courses.grad}} |