All Computer Science is based on the concept of an efficient algorithm: a finite sequence of primitive instructions that, when executed according to their well-specified semantics, provably provide a mechanical solution to the infinitely many instances of a complex mathematical problem within a guaranteed number of steps of least asymptotic growth. We thus call these 'virtues' of Theoretical Computer Science:
We will learn all about important basic algorithms and their analysis, as well as the difference to heuristics or programs/code. Their practical impact is demonstrated in selected implementations.
Lecturer: Martin Ziegler
Lectures: online via Zoom classroom #1501 in building E3-1
Schedule: Tuedays and Thursdays, 9:00am to 10:15
Language: English only (except for students discussing in KLMS)
Teaching Assistants: 이현우 (head), 임동현, 황지만 , 김영훈, 김연수, 최재훈, 최홍규, Arnur Makenov
Office hours: TBD
Quiz: On randomly selected sessions we will perform a short online quiz.
Grading: The final grade will (essentially) be composed as follows: Homework 30%, Quizzes+Attendance 10%, Midterm exam 30%, Final exam 30%.
Midterm: April 20
Recommended background: CS204 (Discrete Mathematics), CS206 (Data Structures)
Philosophy: Education is a Human Right, not a competition.
This course aims beyond, and takes for granted students mastering, the first level of Bloom's Hierarchy of cognitive learning.
Receptive learning and reproductive knowledge do not suffice for thorough understanding. Hence, for students' convenience, we will regularly offer homework assignments, both theoretically and practically; and encourage working on them by having a random selection of them enter into the final grade.
Submit your individual handwritten solutions to theoretical problems in due time into one of the homework submission boxes; and the programming assignments in ELICE
Late homework submissions (until 7pm) will receive a 50% penalty.
Copied solutions receive 0 points and personal interrogation during office/claiming hours.
Cheating during the exam results in failed grade F.
You are to sign and submit a pledge of integrity with your first written homework solution.
For your convenience some of these books have been collected in KAIST's library 'on reserve' for this course.