Honors Discrete Math COT 3100C, Fall 2026
- Lectures
- Tuesday and Thursday, 9:00–10:15am, NSC 102
- Office hours
- Tuesday, 2:00–3:00pm, HEC 245E
- Instructor
- Karthik Gajulapalli
- karthik.complexity+discrete@gmail.com
- Webcourses
- webcourses.ucf.edu/courses/1519954
- Syllabus
- Official syllabus
Discrete math is the core building block of computer science. Algorithms, networks, cryptography, databases, AI, and even social networks all have discrete math hiding underneath. In this class we'll learn to turn our intuition about why things work into rigorous logical statements. Along the way we'll learn how to count the number of pizza orders you can make with four toppings, and, perhaps most importantly, how to set the right lineup to win your fantasy football league.
Textbook. There is no textbook. References are posted for each lecture in the schedule below.
Grading. Quiz 1 (1%), course evaluations (1%), homework (15%), scribe notes (10%), final project (15%), three exams (20% each).
Schedule
Tentative. Topics past the current week may move.
| # | Date | Topic | Notes | Scribe notes | References |
|---|---|---|---|---|---|
| 1 | Aug 25 | Introduction | Slides | – | Stable matchings: [EIV], Chapter 1 |
| 2 | Aug 27 | Boolean algebra, Peano's axioms | Boolean algebra, Peano axioms | – | Wikipedia: Boolean algebra, Peano axioms |
| 3 | Sep 1 | Logic and proofs | Logic and proofs | – | Stanford CS103, Guide to Proofs |
| 4 | Sep 3 | Predicates and quantifiers | Predicates and quantifiers | – | Stanford CS103, Lecture 3 slides (up to the section on functions) |
| Homework 1 due Wed Sep 16, 5pm | |||||
Anonymous feedback
If you'd like to send me a message anonymously about the course, send me a note through the form below. It doesn't ask for a name or email and doesn't require signing in, so I receive only the text and can't reply — if you need an answer, email me directly instead.