This class was tough.
Course Overview:
It is a required course for all CS and CE majors. The sorting algorithms you learn and the complexity of them is very important to the field.
Course highlights:
Learning the complexity of a binary search tree, graph theory, and Big O vs little O notation
Hours per week:
6-8 hours
Advice for students:
Do the homeworks and attend lecture. His exams and homeworks are usually modified versions of stuff he goes over in class.