Instructor: Dr. William DeMeo
Office: LeConte 314C
Office Hours: Wed, Thu, Fri 11–12
Tentative Schedule (updated 11/27)
Course Outline: We will cover as much as time permits of the following topics: propositional and predicate logic; proof techniques; recursion and recurrence relations; sets and combinatorics; functions, relations and matrices, lattices, graphs and trees.
Logic, proof techniques, and recursion provide the mathematical foundation for both writing a program and demonstrating its correctness. Sets, combinatorics, functions, relations, matrices and lattices comprise the most basic objects and relationships that are used in computer science. Graphs and trees can be used as models of many real world pheneomena, while also being amenable to computer programming.