CS311H Fall 2016

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

Logistical Information:

Instructor: Işıl Dillig
Lecture time: Tuesday, Thursday 5:00 pm - 6:15 pm
Lecture room: GDC 5.302
Discussion sections: Mon 2-3 pm (SAC 5.102) and Wed 2-3pm (GDC 1.406)
Instructor e-mail: isil@cs.utexas.edu
Instructor office hours: Tuesday, Thursday 6:15-7:00 pm
TA: John Kallaugher
TA's e-mail: jmgkaa@gmail.com
TA office hours: Monday 3-5 pm
Proctor: Jacob Van Geffen
Proctor's e-mail: JSVANGEFFEN@gmail.com
Proctor's office hours: Wednesday 3-5 pm
Prerequisites: Admission to the CS Turing Scholars program
Textbook (optional): Kenneth H. Rosen, Discrete Mathematics and Its Applications, 7th edition.
Course Webpage: http://www.cs.utexas.edu/~idillig/cs311h/

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 two midterms. Each midterm will be an in-class and closed-book, closed-notes exam. Each midterm counts for 20% of your final grade.
  • The course has a closed-book, closed-notes final exam. The final exam counts for 40% of your grade.
  • No make-up exams will be given (except in cases of documented medical emergencies).
  • There will be weekly written homework assignments. These assignments do not involve any programming, and will help you better understand the material taught in the class as well as prepare you for the midterm and final exams. The homework assignments collectively count for 20% of your final grade.
  • There may be a curve of the final grades, although the lower bounds of the standard scale are guaranteed, i.e., you will get an A- or A if your grade is 90 or above, a B(-/+) if it is 80-89, etc.

    Homework Policies:

  • Each assignment is due at the beginning of class on the indicated date.
  • Each homework should be done in accordance with the Honor Code .
  • No late assignments will be accepted, but we will drop your lowest homework score for calculating final grades.

    Discussion Forum:

    While the Professor and the TA are happy to answer your questions, we believe your peers will be an equally important resource in this course. Therefore, we encourage you to subscribe to our class piazza page. While you are welcome to discuss any high-level concepts, you may not share (full or partial) solutions to specific homework problems.


  • This first class will meet on Thursday August 25 at 5:00 pm in GDC 5.302.
  • The university add/drop deadline is Monday, August 29.
  • The university deadline for withdrawing from the course is Tuesday, November 1.
  • The midterms are scheduled for September 29 and November 10, respectively.
  • The final exam is scheduled for 7-10 pm on Tuesday, December 8.

    Honor Code:

  • For the homework assignments you may talk about the problem with fellow students, the TA, and the instructor, but the write-up must be yours.
  • For the written assignments and the projects, you are allowed to consult other books, papers, or published material. The Web is also considered a publication media. However, you MUST reference all the sources that helped you in the assignment.
  • You should not plagiarize. Therefore, you should write solutions in your own words, even if the solutions exist in a publication that you reference.
  • For more information, please refer to the departmental guidelines on academic honesty.


    Date Lecture topics Slides Reading (optional) Assigned Due
    08/25 Logic I Handout 1 Rosen 1.1, 1.2    
    08/30 Logic II Handout 2 Rosen 1.3 Homework 1  
    09/01 Logic III Handout 3 Rosen 1.4, 1.5    
    09/06 Logic IV Handout 4 Rosen 1.6 Homework 2 Homework 1
    09/08 Logic V Handout 5 Rosen 1.7    
    09/13 Proof methods Handout 6 Rosen 1.8 Homework 3 Homework 2
    09/15 Sets Handout 7 Rosen 2.1-2.2    
    09/20 Career fair (no class)        
    09/22 Functions Handout 8 Rosen 4.1, 4.2 Homework 4 Homework 3
    09/27 Number theory I Handout 9 Rosen 4.1, 4.2, 4.4   Homework 4
    09/29 Midterm I        
    10/04 Number theory II Handout 10 Rosen 4.6 Homework 5  
    10/06 Crypto Handout 11      
    10/11 Induction 1 Handout 12 Rosen 5.1, 5.2 Homework 6 Homework 5
    10/13 Induction II Handout 13 Rosen 5.3    
    10/18 Induction III Handout 14 Rosen 5.3    
    10/20 Combinatorics I Handout 15 Rosen 6.1, 6.2   Homework 6
    10/25 Combinatorics II Handout 16 Rosen 6.3-6.5 Homework 7  
    10/27 Combinatorics III Handout 17 Rosen 6.5    
    11/01 Graphs I Handout 18 Rosen 10.1, 10.2 Homework 8 Homework 7
    11/03 Graphs II Handout 19 Rosen 10.7, 10.8, 10.4    
    11/08 Graphs III Handout 20 Rosen 11.1   Homework 8
    11/10 Midterm II        
    11/15 Graphs IV Handout 21 Rosen 10.5 Homework 9  
    11/17 Complexity Handout 22 Rosen 3.2    
    11/22 Recurrences Handout 23 Rosen 8.3 Homework 10 Homework 9
    11/24 THANKSGIVING        
    11/29 Master theorem Handout 23 Rosen 8.3    
    12/01 Review       Homework 10