Hsin Hao Su
May 11, 2026 · Historical comment
Hardest class I have ever taken in my life. Tough grader, difficult exams, and difficult homework. Barely understood anything from his lectures.
CSCI3383 · Computer Science
Morrissey College of Arts & Sciences
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.
Course experience
Averages use the original five-point historical evaluation scale.
Organization
4.0 / 5
How well the course was organized
Challenge
4.8 / 5
How intellectually challenging students found it
Attendance
4.1 / 5
How necessary attendance was
Assignments
4.3 / 5
How helpful assignments were
Weekly effort
~6.5
hours per week
Estimated from the original workload response buckets. Individual sections may differ.
Instructor options
Ratings below reflect only recovered evaluations connected to this course.
Associate Professor, Computer Science
3.5 / 5
3.3 / 5
Visiting Assistant Professor, Computer Science
4.1 / 5
3.8 / 5
Assistant Professor, Computer Science
4.0 / 5
3.6 / 5
Assistant Professor, Computer Science
3.7 / 5
3.1 / 5
Associate Professor, Computer Science
3.6 / 5
3.2 / 5
Associate Professor, Computer Science
3.9 / 5
3.6 / 5
Student perspective
Recovered and new anonymous comments are shown as written and may reflect different course formats.
May 11, 2026 · Historical comment
Hardest class I have ever taken in my life. Tough grader, difficult exams, and difficult homework. Barely understood anything from his lectures.
Across time
Section-level results available in the recovered archive.
Spring 2025
2 sectionsFall 2024
2 sectionsSpring 2024
2 sectionsFall 2023
2 sectionsSpring 2023
1 sectionFall 2022
2 sectionsSpring 2022
1 sectionFall 2021
2 sectionsFall 2020
2 sectionsSpring 2020
1 section