CS311H Fall 2018


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


Logistical Information:

Instructor: Işıl Dillig
Lecture time: Tuesday, Thursday 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 (GDC 1.406)
Instructor e-mail: isil@cs.utexas.edu
Instructor office hours: Tuesday, Thursday 3:15-4:00 pm
TA #1: Varun Adiga (varun.adiga@utexas.edu), Office hours: Friday 2-3:30 pm (TA desk outside of class)
TA #2: Akshay Gupta (akshaykg42@gmail.com), Office hours: Monday 5-6:30 pm (TA desk outside of class)
TA #3: Aditya Durvasula (adityadurvasula@utexas.edu), Office hours: Thursday 11-12:30 pm (TA desk outside of class)
TA #4: Rohan Nair (rohan.nair@utexas.edu), Office hours: Wednesday 2-3:30pm (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 three in-class exams. Each midterm will be closed-book, but you can bring up to three sheets of notes (``cheat sheets" written or typed by you) to the exam.
  • Each midterm counts for 25% of your final grade.
  • This offering of the course does not have a final exam.
  • No make-up exams will be given (except in cases of documented medical emergencies).
  • There will be weekly problem sets. 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 in-class exams. The problem sets 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 instructor and TAs 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.

    Announcements:

  • The first class will meet on September 4 at 2 pm. Note that there is no class on August 30 because the instructor is out-of-town for a conference.
  • The university deadline for withdrawing from the course is November 1.
  • The in-class exams are scheduled for Oct 9, Nov 8, and Dec 6.

    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.

    Syllabus:

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