Discrete Mathematical Structures I

Catalog description

Introduction to the mathematics fundamental to all phases of computer science, i.e. from the formulation of problems, to the understanding of their underlying structure, to the comparative analysis of the complexity of algorithms that can be used to solve these problems. The first semester of this sequence introduces combinatorics, first-order logic, induction, set theory, relations and functions. This course may utilize some examples and exercises in Mathematica or other very high level language.