Skip to content Skip to navigation

Introduction to Discrete Structures I

01:198:205

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
Prerequisite: 

01:198:11101:640:152. Credit not given for this course and 14:332:312.

Please note that courses for which a student has received a grade of D cannot be used to satisfy prerequisite requirements.a

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.
Learning Goals: 
Computer Science majors ...
  • will be prepared to contribute to a rapidly changing field by acquiring a thorough grounding in the core principles and foundations of computer science (e.g., techniques of program design, creation, and testing; key aspects of computer hardware; algorithmic principles).
  • will acquire a deeper understanding on (elective) topics of more specialized interest, and be able to critically review, assess, and communicate current developments in the field.
  • will be prepared for the next step in their careers, for example, by having done a research project (for those headed to graduate school), a programming project (for those going into the software industry), or some sort of business plan (for those going into startups).
Semester: 
Fall
Spring
Summer
Course Type: 
Undergraduate

Check the University Schedule of Classes to see if this course is open.

Request an Special Permission Number here if the class is full.