Discrete Structures

Catalog description

See Computer Science 208. How do we "know" that a mathematical or logical statement is correct? What common properties appear among different collections? How might we represent functions, and how can we tell if two functions with different representations are the same? Can we formally describe and understand common diagrams? We consider such questions as we develop both intuition and formal mechanisms for addressing them. Along the way, we explore Boolean logic, proof techniques, sets, structures that include trees and graphs, and more Students who are taking or have previously taken Math 218 may not take Computer Science/Math 208. Prerequisite: Computer Science 151 and Math 124 or 131, and completion of or concurrent registration in Computer Science 161. STAFF.