ZTC Resource & Course

Discrete Mathematics is not only to computer science majors but also to a broader audience, particularly those studying mathematics and science. This course equips students with essential tools for formal reasoning. Key topics covered include counting principles, propositional and first-order logic, set theory, and functions, with a specific focus on recursive functions. Additionally, it explores partial order and equivalence relations, Boolean algebra, and switching circuits, as well as the concepts of graphs and trees. A significant emphasis is placed on developing communication skills; students are expected to interpret, describe, discuss, and justify their conclusions using logical reasoning. Although the course primarily addresses reasoning in the context of computer programs, prior programming knowledge is not a prerequisite.