Not too easy. Not too difficult.
You learn a lot of material in this course, and nearly all of it is helpful in situations both in and outside of engineering. If you're big on math, you'll probably really enjoy this course, especially if you enjoy the theoretical aspects behind induction, recursion, and graph theory.
Highlights were the entirety of the tree and graph sections, which go into various algorithms that can determine shortest paths or minimum spans using incredible techniques.
Hours per week:
Advice for students:
The exams are difficult, and the averages are typically very low--do not be alarmed. If you do well on the homeworks and solidify your understanding in the theory behind every concept (and not just the concepts themselves) you will have no trouble completing the problems on the midterms and final exam.