A problem-solving approach to discrete mathematics, covering secret codes, public-key codes, error-correcting codes, enumeration, recurrence relations, induction, graph theory, graph algorithms and parallel algorithms. Prerequisite: MATH 30-1, 30-2, or equivalent. Note : Credit can only be obtained in at most one of MATH 111 or MATH 222.
A problem-solving approach to discrete mathematics, covering secret codes, public-key codes, error-correcting codes, enumeration, recurrence relations, induction, graph theory, graph algorithms and parallel algorithms. Prerequisite: MATH 30-1, 30-2, or equivalent. Note : Credit can only be obtained in at most one of MATH 111 or MATH 222.
