CSE 331LR - Algorithms and Complexity

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, Spring

Requisites:
Pre-Requisite: MTH 142 or MTH 139, and CSE 250 and (CSE 191 or MTH 311). Computer Science, Computer Engineering, or Bioinformatics majors only.