CS311H Fall 2016

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

Logistical Information:

Instructor: Işıl Dillig
Lecture time: Monday, Wednesday 2:00 pm - 3:15 pm
Lecture room: GDC 1.304
Discussion sections: Friday 12-1 pm (GDC 1.406) and Friday 1-2 pm (CBA 4.344)
Instructor e-mail: isil@cs.utexas.edu
Instructor office hours: Monday, Wednesday 5-6 pm
TA #1: Jacob Van Geffen (jsvangeffen@utexas.edu), Office hours: Tuesday 12:30-2pm (TA desk outside of class)
TA #2: Varun Adiga (varun.adiga@utexas.edu), Office hours: Friday 2-3:30 pm (TA desk outside of class)
TA #3: Akshay Gupta (akshaykg42@gmail.com), Office hours: Thursday 2:30-4 pm (TA desk outside of class)
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 35% 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 25% 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 Wednesday, August 30 at 2:00 pm.
  • No class on September 4 due to Labor Day.
  • The university add/drop deadline is September 5.
  • The university deadline for withdrawing from the course is November 7.
  • The midterms are scheduled for October 11 and November 20.
  • The final exam is scheduled for Saturday, December 16, 9 am - 12 pm.

    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 Handouts Reading Assigned Due
    08/30 Logic I Handout 1 Rosen 1.1, 1.2    
    09/06 Logic II Handout 2 Rosen 1.3 Homework 1  
    09/11 Logic III Handout 3 Rosen 1.4, 1.5    
    09/13 Logic IV Handout 4 Rosen 1.6 Homework 2 Homework 1
    09/18 Logic V, Proof methods Handout 5 Rosen 1.7    
    09/20 Proof methods, sets Handout 6 Rosen 1.8 Homework 3 Homework 2
    09/25 Sets, functions Handout 7 Rosen 2.1-2.2    
    09/27 Functions, number theory Handout 8 Rosen 4.1, 4.2 Homework 4 Homework 3
    10/02 Number theory Handout 9 Rosen 4.1, 4.2, 4.4    
    10/04 Number theory Handout 10 Rosen 4.6   Homework 4
    10/09 Review        
    10/11 Midterm I        
    10/16 Induction 1 Handout 11 Rosen 5.1, 5.2 Homework 5  
    10/18 Induction II Handout 12 Rosen 5.3    
    10/23 Induction III Handout 13 Rosen 5.3 Homework 6 Homework 5
    10/25 Combinatorics I Handout 14 Rosen 6.1, 6.2    
    10/30 Combinatorics II Handout 15 Rosen 6.3-6.5 Homework 7 Homework 6
    11/01 Combinatorics III Handout 16 Rosen 6.5    
    11/06 Graphs I Handout 17 Rosen 10.1, 10.2 Homework 8 Homework 7
    11/08 Graphs II Handout 18 Rosen 10.7, 10.8, 10.4    
    11/13 Graphs III Handout 19 Rosen 11.1   Homework 8
    11/15 Midterm review        
    11/20 Midterm II        
    11/27 Complexity Handout 20 Rosen 10.5 Homework 9  
    11/29 Euler circuits Handout 21 Rosen 3.2    
    12/04 Recurrences Handout 22 Rosen 8.3 Homework 10 Homework 9
    12/06 Master theorem Handout 23 Rosen 8.3    
    12/11 Review       Homework 10