Course
CRS-0101-02-003Intermediate Algorithms and Theory
intermediateactive
Examines NP-completeness, approximation algorithms, randomized algorithms, and complexity classes.
Intermediate Algorithms and Theory
intermediateactive
Also known as: Algorithms II, Advanced Algorithm Design
| Course name | Intermediate Algorithms and Theory |
|---|---|
| Course code | CRS-0101-02-003 |
| Canonical ID | urn:taxonomy:cip-aligned:course:0101-02-003 |
| Level | intermediate |
| Status | active |
| Subject | Algorithms and Theory (SUB-0101-02) |
| Discipline | Computer Science (DIS-0101) |
| Category | Computing and Information Sciences (CAT-01) |
Examines NP-completeness, approximation algorithms, randomized algorithms, and complexity classes.
Credit hours
| Min | 3 |
|---|---|
| Max | 3 |
| Type | semester |
Contact hours
| Lecture | 3 |
|---|---|
| Lab | 0 |
| Studio | 0 |
| Clinical | 0 |
| Practicum | 0 |
Learning outcomes
- Classify problems by complexity class.
- Design approximation and randomized algorithms.
- Prove NP-completeness via reduction.