CS 2802 - Discrete Structures - Honors

General Information

An honors introduction to discrete math.

Prerequisites

From Spring 2020 course page: The official prerequisite for course is a programming course, but it’s not critical. If you are taking CS 1110 or CS 2110 concurrently, that’s fine. If not, and you haven’t taken any programming courses, speak to Prof. Halpern.

Topics Covered

Textbook: Mathematics for Computer Science by Eric Lehmann, Albert Meyer, and Tom Leighton

  • Proving things, a little logic, and induction: Chapters 1, 3, 5, 8
  • Number Theory: Chapter 9
  • Combinatorics: Chapter 15
  • Probability: Chapters 17 - 20
  • Graph Theory: Chapters 10, 12, 13
  • Automata Theory: not covered in the text; we’ll take this material from Rosen
  • little more logic (not really covered in the book well, but it will be only a few lectures)

Workload

General Advice

Testimonials

Past Offerings

| Semester | Time | Professor | Median Grade | Enrollment | Course Page | | — | — | — | — | — |

Edit this page on GitHub: classes/CS2802.md

Edit me on GitHub