CIT 256. Discrete Structures for Information Technology (3)

Prerequisites: Grade of “C-” or better in each of COMP 182/L and (MATH 103 or MATH 150A or MATH 255A). Study of discrete mathematics and formal proof techniques as used in information technology. This course introduces formal logic and discrete structures, including truth tables, functions, relations, sets, graphs, and trees. Proof techniques are presented, such as proof by induction, proof by contradiction and proof by cases. Counting techniques and complexity theory are discussed.