CS311H Fall 2021


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


Logistical Information:

Instructor: Işıl Dillig
Lecture time: Tuesday, Thursday 2-3:30pm
Lecture room: GDC 4.304 and Zoom
Discussion sections: Friday 2-3pm (JGB 2.202)
Instructor e-mail: isil@cs.utexas.edu
Instructor office hours: Thursday 3:30-4:30pm
TA #1: Ana Brendel (anabrendel25@gmail.com), Office hours: Tuesday 3:30-5pm
TA #2: Shray Vats (svats@utexas.edu), Office hours: Monday 1-2:30pm
TA #3: Arnav Mohan (arnavmohan@gmail.com), Office hours: Wednesday 6pm, Friday 10 am
Prerequisites: Admission to the CS Business Honors 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 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.
  • The remaining 5% of the grade will be for class participation.
  • The final grades will be curved.

    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:

    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 August 31.
  • The university deadline for withdrawing from the course is October 28.

    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 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
    08/31 Logic 1 Lecture 1 Rosen 1.1, 1.2 Problem set 1  
    09/02 Logic 2 Lecture 2 Rosen 1.3    
    09/07 Logic 3 Lecture 3 Rosen 1.4, 1.5 Problem set 2 Problem set 1
    09/09 Logic 4 Lecture 4 Rosen 1.6    
    09/14 Proof methods Lecture 5 Rosen 1.7, 1.8 Problem set 3 Problem set 2
    09/16 Sets Lecture 6 Rosen 2.1, 2.2    
    09/21 Functions Lecture 7 Rosen 2.3 Problem set 4 Problem set 3
    09/23 Number theory 1 Lecture 8 Rosen 4.1    
    09/28 Number Theory 2 Lecture 9 Rosen 4.3 Problem set 5 Problem set 4
    09/30 Exam 1        
    10/05 Combinatorics 1 Lecture 10 Rosen 5.1    
    10/07 Combinatorics 2 Lecture 11 Rosen 5.2 Problem set 6 Problem set 5
    10/12 Combinatorics 3 Lecture 12 Rosen 5.3    
    10/14 Induction 1 Lecture 13 Rosen 6.1, 6.2 Problem set 7 Problem set 6
    10/19 Induction 2 Lecture 14 Rosen 6.3, 6.4    
    10/21 Induction 3 Lecture 15 Rosen 6.5    
    10/26 Graphs 1 Lecture 16     Problem set 7
    10/28 Exam 2        
    11/02 Graphs 2 Lecture 17 N/A Problem set 8  
    11/04 Graphs 3 Lecture 18 N/A    
    11/09 Complexity Lecture 19 N/A Problem set 9 Problem set 8
    11/11 Recurrences Lecture 20 N/A    
    11/16 Master theorem Lecture 21 Rosen 3.2    
    11/18 TBD       Problem set 9
    11/30 TBD        
    12/01 Exam 3