Description
To introduce the student to the mathematical tools of logic and induction, and to the basic definitions and theorems concerning relations, functions, and sets. Later courses in the computer science curriculum build on the mathematical foundations covered here. Particular emphasis is placed on inductive definitions and proofs, with application to problems in computer science.
Credits: 4
01:198:111; 01:640:152. Credit not given for this course and 14:332:202.
Please note that courses for which a student has received a grade of D cannot be used to satisfy prerequisite requirements.
Semesters Offered:Spring, summer and fall
Topics: Basic Set Notation, Propositional Logic, Truth Tables, Boolean Circuits
First-Order Logic, Predicates. Quantifiers
Mathematical Induction: Program Correctness, Trees, Grammars
Relations: Closures of relations. Orders, Equivalence Relations, Functions
Finite-State Machines
Expected Work: Regular class assignments; no programming.
Exams: Quizzes, 1 or 2 hourlies and a final exam.
