Discrete Mathematics (CS204B) in Fall 2018 at KAIST's School of Computing

Discrete Mathematics is the background of digital computers:
the mathematical foundation for specifying program languages and problems, and for describing, analyzing, and verifying their algorithmic solutions.

As opposed to computing with continuous data (such as real numbers), it is concerned with discrete structures such as integers, finite sequences, graphs, and also algorithms themselves — as well as with their (e.g. combinatorial) properties.

  • Lecturer: Martin Ziegler and Svetlana Selivanova
  • Lectures: classroom #311 in building E11 (Creative Learning)
  • Schedule: Mondays and Wednesdays 14h30 to 15h45
  • Language: English only (except for students discussing in KLMS)
  • Teaching Assistant: Dongseong Seon, Hyun Woo Lee, Seungwoo Schin, Ivan Koswara
  • Office hours: Thursday 14h30 to 17h30 at N1 #402

Claiming/office hour on Nov.29 will be held in E3-1 #3444

  • Homework Box: Submit to E3-1 first floor, homework box #8 (in front of classroom 1101)
  • Quiz: On some lecture sessions we will conduct short written quizzes. The first quiz: September 11(Monday), second quiz: October 8(Monday)!
  • Homework: Of the 3 weekly homework problems, a random one will be graded. Due: Wednesday 13h00. Late submission up to Wednesday 19h00 with 50% point deduction.
  • Grading: The final grade will (essentially) be composed as follows: Quiz: 20%, Homework 30%, Midterm exam 30%, Final exam 30%.
  • Exams: All exams are closed book!
    • Midterm exam (Wednesday, October 17, 13h00-15h45)
    • Final exam (Wednesday, December 12, 13h00-15h45)
    • If your student number is smaller than 20170326, then go to Room#301. Otherwise, go to Room#311 (Same building as usual, E11).

Final exam claiming hour on Dec.18 in E3-1 #3444 from 14h30 to 17h30

  1. Basic Structures: Sets
  2. Logical Foundations, propositions, quantifiers
  3. Proof strategies: constructive, indirect/contradiction, cases, induction
  4. Relations, order, equivalence
  5. Functions, sequences, strings
  6. Asymptotic growth of functions


  7. Elementary algorithms and their analysis
  8. Combinatorics
  9. Advanced Counting
  10. Discrete probabilities
  11. Graph Theory
  12. Trees
  13. Recursion


Regularly recalling, applying, and extending the definitions, theorems, and proofs from the lecture is essential for comprehension and successful study. Therefore consider it as a courtesy that we will create homework assignments and publish them on this web page.

Write your submission number (like “Assignment #?”) to make TAs easily recognize the submissions and please bind them. For binding, please use the stapler. Submissions won't be returned.

Copied homework solutions receive 0 points. Cheating during the exam results in expulsion and 0 points.

Students will be required to sign an Academic Honour Code together with their first homework submission. Honor Code is included in the first homework.

  • Kenneth H. Rosen: Discrete Mathematics and Its Applications (mandatory! any edition)
  • Richard Johnsonbaugh: Discrete Mathematics, Pearson.
  • David J. Hunter: Essentials of Discrete Mathematics, Jones&Bartlett.

For your convenience some of these books have been collected in KAIST's library 'on reserve' for this course.

Due to the large number of students enrolled, we unfortunately cannot answer questions by email. Instead please use the KLMS Bulletin Board or visit the TAs during their office hours.