Next revision | Previous revisionLast revisionBoth sides next revision |
lectures:2017:cs204 [2017-11-13] – created junheecho | lectures:2017:cs204 [2018-03-25] – [Synopsis (tentative)] Martin Ziegler |
---|
===== Synopsis (tentative) ===== | ===== Synopsis (tentative) ===== |
| |
- Ordered List ItemBasic Structures: Sets, Functions, Sequences | - Basic Structures: Sets |
- Logical Foundations, propositions, quantifiers | - Logical Foundations, propositions, quantifiers |
- Proof strategies: constructive, indirect/contradiction, cases, induction | - Proof strategies: constructive, indirect/contradiction, cases, induction |
- Relations, order, equivalence | - Relations, order, equivalence |
| - Functions, Sequences, Strings |
- Elementary algorithms and their analysis \\ \\ Mid-term \\ \\ | - Elementary algorithms and their analysis \\ \\ Mid-term \\ \\ |
- Combinatorics and Counting | - Combinatorics and Counting |
- Graph Theory | - Graph Theory |
- Trees/Automata \\ \\ Final | - Trees/Automata \\ \\ Final |
| |
===== Homework/Assignments/Recitation ===== | ===== 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. | 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. Submissions won't be returned. | Write your submission number (like "Assignment #?") to make TAs easily recognize the submissions |
| and submit them in box #18 near E3-1 elevator. Submissions won't be returned. |
| |
* [[https://complexity.kaist.ac.kr/17CS204/CS204C_HW00.pdf|Honor Code + Homework 0]] (Due: 14:40 September 8) | * {{:lectures:2017:cs204c_hw00.pdf|Honor Code + Homework 0}} (Due: 14:40 September 8) |
* [[https://complexity.kaist.ac.kr/17CS204/CS204C_HW01.pdf|Homework 1]] (Due: 14:40 September 15) (Changed due to the coverage, 16:00 September 8) | * {{:lectures:2017:cs204c_hw01.pdf|Homework 1}} (Due: 14:40 September 15) (Changed due to the coverage, 16:00 September 8) |
* [[https://complexity.kaist.ac.kr/17CS204/CS204C_HW02.pdf|Homework 2]] (Due: 14:40 September 22) (Condition edited on Problem 2(c), 03:40 September 17) | * {{:lectures:2017:cs204c_hw02.pdf|Homework 2}} (Due: 14:40 September 22) (Condition edited on Problem 2(c), 03:40 September 17) |
* [[https://complexity.kaist.ac.kr/17CS204/CS204C_HW03.pdf|Homework 3]] (Due: 14:40 September 29) (Hints Added on Problem 2, 16:05 September 23) | * {{:lectures:2017:cs204c_hw03.pdf|Homework 3}} (Due: 14:40 September 29) (Hints Added on Problem 2, 16:05 September 23) |
* [[https://complexity.kaist.ac.kr/17CS204/CS204C_HW04.pdf|Homework 4]] (Due: 14:40 Octover 13) | * {{:lectures:2017:cs204c_hw04.pdf|Homework 4}} (Due: 14:40 Octover 13) |
* [[https://complexity.kaist.ac.kr/17CS204/CS204C_HW05.pdf|Homework 5]] (Due: 14:40 November 10) (Edited, 18:30 November 10) | * {{:lectures:2017:cs204c_hw05.pdf|Homework 5}} (Due: 23:59 November 12) (Edited, 18:30 November 10) |
* [[http://theoryofcomputation.asia/17CS204/HW06.pdf|Homework 6]] (Due: 14:40 November 17) | * {{:lectures:2017:cs204c_hw06.pdf|Homework 6}} (Due: 14:40 November 17) |
| * {{:lectures:2017:cs204c_hw07.pdf|Homework 7}} (Due: 14:40 November 24) |
| * {{:lectures:2017:cs204c_hw08.pdf|Homework 8}} (Due: 09:00 December 4) (Edited at 23:23 November 24) |
| |
In collaboration with CS204A and CS204B, TAs will offer optional recitation classes: Wednesdays 7~8pm #1220, starting September 6. \\ | In collaboration with CS204A and CS204B, TAs will offer optional recitation classes: Wednesdays 7~8pm #1220, starting September 6. \\ |