Course
CRS-0101-02-002Methods in Algorithms and Theory
introductoryactive
Covers algorithm design paradigms including divide-and-conquer, greedy, dynamic programming, and network flow.
Methods in Algorithms and Theory
introductoryactive
Also known as: Algorithm Design, Algorithmic Methods
| Course name | Methods in Algorithms and Theory |
|---|---|
| Course code | CRS-0101-02-002 |
| Canonical ID | urn:taxonomy:cip-aligned:course:0101-02-002 |
| Level | introductory |
| Status | active |
| Subject | Algorithms and Theory (SUB-0101-02) |
| Discipline | Computer Science (DIS-0101) |
| Category | Computing and Information Sciences (CAT-01) |
Covers algorithm design paradigms including divide-and-conquer, greedy, dynamic programming, and network flow.
Credit hours
| Min | 3 |
|---|---|
| Max | 3 |
| Type | semester |
Contact hours
| Lecture | 3 |
|---|---|
| Lab | 0 |
| Studio | 0 |
| Clinical | 0 |
| Practicum | 0 |
Learning outcomes
- Apply divide-and-conquer, greedy, and dynamic programming.
- Model problems as network flow or matching problems.
- Prove correctness of algorithmic solutions.