Skip to main content.

Courses

Subjects

Search Results

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

CSE 331LR Algorithms and Complexity

Lecture

Introduces paradigms for designing algorithms and fundamental limitations to what algorithms can do. Covers basic algorithm design paradigms of greedy algorithms, divide and conquer algorithms and dynamic programming, as well as a selection of advanced algorithmic topics, such as randomized algorithms, algorithms for distributed systems and basic algorithms for machine learning. Topics related to limitations of algorithms include NP-completeness and undecidability. Coverage includes analyzing algorithms via proofs and programming assignments to implement algorithms.

Credits: 4
Grading: Graded (GRD)
Typically Offered: Fall
Other Requisites: Pre-reqs: MTH 142 and CSE 250 and (CSE 191 or MTH 331). Approved Computer Science, Computer Engineering, Bioinformatics/CS Majors only.

Course Search

 
Published: Mar 25, 2019 15:45:57