As a complement to calculus, which is the study of continuous processes, this course focuses on the discrete, including finite sets and structures, their properties and applications. Topics will include basic set theory, infinity, graph theory, logic, counting, recursion, and functions. The course serves as an introduction not only to these and other topics but also to the methods and styles of mathematical proof. Format: lecture/discussion. Evaluation will be based primarily on homework, classwork, and exams. Prerequisites: Mathematics 104 or Mathematics 103 with Computer Science 134 or one year of high school calculus with permission of instructor. No enrollment limit (expected: 20).

Hour: First Semester: DEVADOSS Second Semester: MORGAN