Not too easy. Not too difficult.
Course Overview:
Very theoretical and abstract. It's an excellent introduction to computing sciences topics such as automata, algorithms, and most interesting of all artificial intelligence.
Course highlights:
Discrete mathematics, boolean algebra, basic circuits, binary and decimals, predicates, lots of abstract proofs like induction, strong induction, set theory, counting, functions, binary relations and ordering.
Hours per week:
3-5 hours
Advice for students:
Don't need the textbook and there's no programming! Many didn't like Dr. Salavatipour but I thought he was smart and interesting. Most will say that it's the hardest computing science course but I don't think it is once you get used to notation and abstract proofs. Only study what's important before the finals. Theoretical topics at the end of each lectures will not be on the exam. Stuff like hasse diagrams, topological sorting, and the halting problem are just topics he likes to explain for fun. Seminars are extremely important! Attend them because there used to be a mandatory quiz component.