This class is easy and useful for CS, but proofs in this class are painful. If you put in good effort on all your homework, you should be able to get through this class.

2 exams, 22% and 25% respectively. Assignments are half-completion based half-correctness based. You learn propositional logic, induction proofs, recursion, counting, and graphs. Useful if you are going into CS.

Professor is nice and forgiving, so you won't have problems communicating with him. His lecturing on the other hand, tends to be disorganized if he isn't following along with his notes. You will definitely understand what he's saying, but you won't get questions answered clearly. Lots of stuttering.

you get a 8.5 x 11 inch note card for exams. Assignments are half-completion based, and recitation is fully completion based.