A study of discrete mathematics as it applies to computer science. Concepts covered include number systems, sets, logic, Boolean algebra, digital circuits, combinatorics, relations, functions, vectors, matrices, graphs, and induction proofs.
Linked below are some handouts from the course that contain a mixture of notes as well as practice problems.
Examples of Proofs About Sets and Functions
Proofs in Propositional Logic Homework
Proofs in Propositional Logic Notes