| Term | Evaluations | Course rating | Instructor rating |
|---|---|---|---|
| Spring 2025 | 2 | 3.8 | 4.1 |
| Fall 2024 | 2 | 3.3 | 3.8 |
| Spring 2024 | 2 | 3.9 | 4.0 |
| Fall 2023 | 2 | 3.3 | 3.8 |
| Spring 2023 | 1 | 3.1 | 3.3 |
| Fall 2022 | 2 | 3.6 | 3.8 |
| Spring 2022 | 1 | 2.9 | 3.0 |
| Fall 2021 | 2 | 3.6 | 3.9 |
| Fall 2020 | 2 | 3.0 | 3.6 |
6 of 6 instructors
This course is a study of algorithms for, among other things, sorting, searching, pattern matching, and manipulation of graphs and trees. Emphasis is placed on the mathematical analysis of the time and memory requirements of such algorithms and on general techniques for improving their performance.
Estimated from the original workload response buckets. Individual sections may differ.
| Spring 2020 | 1 | 3.9 | 4.1 |
Written reviews 1
Anonymous student feedback, shown as submitted.
1 of 1 reviews
Semester not recorded
Hardest class I have ever taken in my life. Tough grader, difficult exams, and difficult homework. Barely understood anything from his lectures.