# Discrete Mathematics (CS204C) in Spring 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**Lectures:**classroom #111 in building N1**Schedule:**Tuesdays and Thursdays 14h30 to 15h45**Language:**English only**Teaching Assistants:**Dongsong Seon, Donghyeon Lim, Ivan Koswara**Office hours:**TBD**Homework Box:**TBD. Students must submit their assignments into the Homework Box. (Homework 1~)**Attendance:**10 points for missing less than 15% of randomly sampled lectures, 9 when missing <19%, 8 when missing <23%, and so on: 50% or more missed randomly sampled lectures earn you no attendance points. (No need for excused misses, these are accounted for in the free 15%)**Grading:**The final grade will (essentially) be composed as follows: Homework 20%, Midterm exam 30%, Final exam 40%, Attendance 10%.**Exams:****All exams are closed book.**- Midterm exam (Thursday, April 19, 13h00-15h45)
- Final exam (Thursday, June 14, 13h00-15h45)

## Synopsis (tentative)

- Basic Structures: Sets, Functions, Sequences
- Logical Foundations, propositions, quantifiers
- Proof strategies: constructive, indirect/contradiction, cases, induction
- Relations, order, equivalence
- Elementary algorithms and their analysis

Mid-term

- Combinatorics and Counting
- Discrete probabilities
- Recursion
- Graph Theory
- Trees/Automata

Final

## Homework/Assignments/Recitation

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 submit them in the designated box near the E3-1 elevator. Submissions won't be returned.

- Honor Code + Homework 0 (Due: 14:40 September 8)

## Academic Honesty

Late homework submissions will be ignored for grading. 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.

## Literature:

- 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.