CS311H Fall 2022

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

Logistical Information:

Instructor: Işıl Dillig
Lecture time: Tuesday, Thursday 2 - 3:30 pm
Lecture room: Online on Zoom; Join URL: Join URL: https://utexas.zoom.us/j/94696045680
Discussion sections: Friday 2-3 pm (JES A.215A)
Instructor e-mail: isil@cs.utexas.edu
Instructor office hours: Tuesdays and Thursdays 5-5:30 pm
TA #1: Emily Sturman
TA #2: Jasper Lee
TA #3: Nicolas Hsu
Prerequisites: Admission to the CS Business Honors (CSB) program
Textbook (optional): Kenneth H. Rosen, Discrete Mathematics and Its Applications, 7th edition.
Course Webpage: http://www.cs.utexas.edu/~idillig/cs311h-csb/

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; exams collectively count for 45% of the grade
  • There will be weekly problem sets. The problem sets collectively count for 50% 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 Piazza 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 problem set!
  • Homework Policies:

  • Each assignment is due by noon on the indicated date.
  • Each homework should be done individually You can ask for help and pose clarification questions on Piazza; however, the solutions must be your own. You are not allowed to check/compare solutions with other students in class, and you are not allowed to work in groups.
  • No late assignments will be accepted, but we will drop your lowest homework score for calculating final grades.
  • Solutions to problems sets must be typeset using LaTeX .

    Discussion Forum:

    All course-related discussions should take place on our piazza page. While you are welcome to discuss any high-level concepts, you may not share (full or partial) solutions to specific homework problems. Furthermore, you may not use any other channels (e.g., Facebook groups, SMS chat, Slack, Discord etc.) to discuss homework problems.


  • The first class will meet on August 23.
  • The university deadline for withdrawing from the course is October 25
  • TA office hours and locations will be announced on Piazza.
  • If you need to contact the course staff, please send us a private message on Piazza.
  • Honor Code:

  • Per the homework policy stated above, problem sets are meant to be done individually. Discussing high-level concepts, clarifications about homework questions, latex formatting tips etc. are allowed; however, exchanging answers (even partially) is not allowed. Furthermore, any course-related online discussions should take place on Piazza. Using other forums (especially those that TAs or instructors do not have access to) will be considered a violation of the honor code.
  • 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:

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