CS311H Fall 2025


    Welcome to the home page for
    CS 311H: Discrete Math Honors!


Logistical Information:

Instructor: Işıl Dillig
Lecture time: Tuesday, Thursday 5-6:15 pm
Lecture room: GDC 5.302
Discussion sections: Friday 12–1:30 pm (WCP 5.102) and Friday 1–2:30 pm (GDC 4.302)
Instructor e-mail: isil@cs.utexas.edu
Instructor office hours: Tuesday 6:15-7pm
TAs: Angela Zhang, Kush Sharma, Noah Schell, Archit Patil
Prerequisites: Admission to the CS Turing Scholars program
Textbook (optional): Kenneth H. Rosen, Discrete Mathematics and Its Applications, 7th edition.

Course Description:

This course covers elementary discrete mathematics for computer science. It emphasizes mathematical definitions, logical inference, and proof techniques. Topics include propositional logic, first-order logic, proof methods; sets, functions, relations; mathematical induction, recursion; elementary graph theory; basic complexity theory, recurrences. Please refer to the syllabus for a more detailed description.

Requirements and Grading:

  • This course has three exams that collectively count for 50% of the grade
  • There will be weekly quizzes held during Friday section. The quizzes collectively count for 45% of your final grade.
  • Class participation is required and will count for 5% of your grade. Students are expected to attend class and strongly encouraged to ask and answer questions. Students are also expected to be active on Ed Discussion and strongly encouraged to answer each others' questions.
  • The final grades will be curved, so please do not stress out if the mean is low on an exam or quiz!

    • Discussion Forum:

    All course-related discussions will take place on our Ed Discussion page.

    Announcements:

  • The first class will meet on August 26.
  • This class will make heavy use of Canvas and Ed Discussion, so please familiarize yourself with those platforms.
  • TA office hours and locations will be announced on Ed Discussion.
  • If you need to contact the course staff, please send us a private message on Ed Discussion.

    • Honor Code (Read Carefully!):

  • We take the honor code extremely seriously, and people have faced severe consequences in the past (including failing the class) for not complying with the honor code. So please read this section very carefully.
  • You may not discuss exam questions until after the exams have been graded and handed back, as some of your classmates may not yet have taken the exam.
  • For general guidance on academic honesty, please refer to the departmental guidelines.
  • If you are ever in doubt about honor-code-related issues, please come and talk to the course staff to avoid getting in trouble down the road.

    • Syllabus:

    08/26 Logic 1 Lecture 1 Rosen 1.1, 1.2
    08/28 Logic 2 Lecture 2 Rosen 1.3
    09/02 Logic 3 Lecture 3 Rosen 1.4, 1.5
    09/04 Logic 4 Lecture 4 Rosen 1.6
    09/09 Proof methods Lecture 5 Rosen 1.7, 1.8
    09/11 Sets Lecture 6 Rosen 2.1, 2.2
    09/17 Sets cont. & functions Lecture 7 Rosen 2.3
    09/16 Functions cont.   Rosen 2.3
    09/18 Exam 1 review    
    09/23 Exam 1    
    09/25 Number theory 1 Lecture 8 Rosen 4.1
    09/30 Number Theory 2 Lecture 9 Rosen 4.3
    10/02 Combinatorics 1 Lecture 10 Rosen 6.1, 6.2
    10/07 Combinatorics 2 Lecture 11 Rosen 6.3, 6.4
    10/09 Combinatorics 3 Lecture 12 Rosen 6.5
    10/14 Induction 1 Lecture 13 Rosen 5.1
    10/16 Induction 2 Lecture 14 Rosen 5.2
    10/21 Induction 3 Lecture 15 Rosen 5.3
    10/23 Exam review    
    10/28 Exam 2    
    10/30 Graphs 1 Lecture 16 N/A
    11/04 Graphs 2 Lecture 17 N/A
    11/06 Graphs 3 Lecture 18 N/A
    11/11 Complexity Lecture 19 Rosen 3.2
    11/13 Recurrences Lecture 20 Rosen 8.2
    11/18 Master theorem Lecture 21 Rosen 8.3
    11/25 Thanksgiving break  
    11/27 Thanksgiving break  
    12/02 Review    
    12/04 Exam 3