Course
CRS-0101-02-001Introduction to Algorithms and Theory
introductoryactive
Introduces algorithmic thinking, asymptotic analysis, recurrences, sorting, searching, and basic graph algorithms.
Introduction to Algorithms and Theory
introductoryactive
Also known as: Algorithms I, Discrete Structures for Computing
| Course name | Introduction to Algorithms and Theory |
|---|---|
| Course code | CRS-0101-02-001 |
| Canonical ID | urn:taxonomy:cip-aligned:course:0101-02-001 |
| Level | introductory |
| Status | active |
| Subject | Algorithms and Theory (SUB-0101-02) |
| Discipline | Computer Science (DIS-0101) |
| Category | Computing and Information Sciences (CAT-01) |
Introduces algorithmic thinking, asymptotic analysis, recurrences, sorting, searching, and basic graph algorithms.
Credit hours
| Min | 3 |
|---|---|
| Max | 3 |
| Type | semester |
Contact hours
| Lecture | 3 |
|---|---|
| Lab | 0 |
| Studio | 0 |
| Clinical | 0 |
| Practicum | 0 |
Learning outcomes
- Analyze algorithm running time using asymptotic notation.
- Implement classic sorting and searching algorithms.
- Apply graph traversal to introductory problems.