- Schedule of Classes
Prerequisites: Grade of “C-” or better in each of COMP 182/L, MATH 150A, and PHIL 230. Corequisite: COMP 256L. Study of discrete mathematical structures and proof techniques as used in computer science. Discrete structures, such as functions, relations, sets, graphs and trees. Proof techniques, such as proof by induction, proof by contradiction and proof by cases. Counting techniques. Lab: 3 hours per week.