Discrete Structures for Computing with Lab

Sets, functions, elementary propositional and predicate logic, elementary graph theory, recurrence relations, proof techniques (including mathematical induction and proof by contradiction), combinatorics, probability, and random numbers, with applications to computing. Three hours lecture and one hour lab per week.