An introduction to applications of discrete mathematical systems. Topics include sets, functions, relations, graphs, trees, Boolean algebra, propositional logic, predicate calculus, mathematical induction, permutations, combinations, summation, and recurrences. Examples are drawn from computer science and computer engineering. The discussion sections will be used by the teaching assistants and tutors to discuss homework problems, quiz solutions, and final preparation.
Attendance is entirely optional.
The permanent locations will be posted on the class webpage.