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.
Lectures: classroom #1101 in building E3
Schedule: Wednesdays and Fridays 2:30pm to 3:45pm
Language: English only
Teaching Assistants: Chansu Park, Dongsong Seon, Donghyeon Lim
Office hours: Tue 18:30-20:00 (Other slot is replaced to the recitation class)
Homework Box: No. 18 @ E3-1 3rd floor(next to the elevator). Students must submit their assignments into the Homework Box. (Homework 1~)
Attendance: 10 points for missing less than 5 lectures, 9 when missing 5 lectures, 8 when missing 6, and so on: 14 or more missed lectures earn you no attendance points.
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.
Write your submission number(like "Assignment #?") to make TAs easily recognize the submissions. Submissions won't be returned.
In collaboration with CS204A and CS204B,
TAs will offer optional recitation classes:
Wednesdays 7~8pm #1220, starting September 6.
From November on, attending recitation on time
will be counted as 5% bonus: 1% for each of
Nov.08, Nov.15, Nov.22, Nov.29, Dec.06
Students will be required to sign an Academic Honour Code together with their first homework submission.