This shows you the differences between two versions of the page.
courses:theory2017:main [2017/03/29 10:26] tsay [Announcements] |
courses:theory2017:main [2018/04/25 20:48] (current) tsay [Announcements] |
||
---|---|---|---|
Line 4: | Line 4: | ||
=====Announcements===== | =====Announcements===== | ||
+ | * 07/04: grade report available; please send inquiries, if any, to the instructor by 2PM 07/05. | ||
+ | * 06/18: slides from TA sessions: {{courses:theory2017:toc_ta3.pptx|HW#6-7}}, {{courses:theory2017:toc_ta4.pptx|HW#8-10}}. | ||
+ | * 05/31: {{courses:theory2017:hw10.pdf|HW#10}} due on 06/07. | ||
+ | * 05/24: {{courses:theory2017:hw9.pdf|HW#9}} due on 05/31. | ||
+ | * 05/24: notes/slides for Time Complexity and NP-Completeness available. | ||
+ | * 05/18: {{courses:theory2017:theory2017mid_s.pdf|Suggested Solutions to Midterm Problems}} available (revised on 5/24, 6/25, and 2018/04/25). | ||
+ | * 05/17: notes/slides for Reducibility available. | ||
+ | * 05/10: {{courses:theory2017:hw8.pdf|HW#8}} due on 05/24. | ||
+ | * 05/10: notes/slides for Decidability available. | ||
+ | * 05/03: {{courses:theory2017:hw7.pdf|HW#7}} due on 05/10. | ||
+ | * 04/20: slides from TA sessions: {{courses:theory2017:toc_ta1.pptx|HW#1-2}}, {{courses:theory2017:toc_ta2.pptx|HW#3-5}}. | ||
+ | * 04/19: old exams: {{courses:theory:old_exams.zip|2000-2016}}. | ||
+ | * 04/19: notes/slides for Turing Machines available. | ||
+ | * 04/12: {{courses:theory2017:hw6.pdf|HW#6}} due on 04/26. | ||
* 03/29: {{courses:theory2017:hw5.pdf|HW#5}} due on 04/12. | * 03/29: {{courses:theory2017:hw5.pdf|HW#5}} due on 04/12. | ||
* 03/22: notes/slides for Context-Free Languages and Pushdown Automata available. | * 03/22: notes/slides for Context-Free Languages and Pushdown Automata available. | ||
Line 19: | Line 33: | ||
=====Lectures===== | =====Lectures===== | ||
- | Wednesday 2:20~5:20PM, Room 102, Management Building 2. \\ TA sessions will be | + | Wednesday 2:20~5:20PM, Room 102 (Room 304 from 5/17), Management Building 2. \\ TA sessions will be |
scheduled prior to some of the class meetings between 1:20 and 2:10PM; see the course schedule. | scheduled prior to some of the class meetings between 1:20 and 2:10PM; see the course schedule. | ||
Line 44: | Line 58: | ||
*Finite Automata and Regular Languages (3 weeks: 3/8, 3/15, 3/22*) [{{courses:theory2017:ch1_notes.pdf|notes}}, {{courses:theory2017:ch1_slides.pdf|slides}}, appendix:{{courses:theory2017:ch1_minimization.pdf|minimization}}] | *Finite Automata and Regular Languages (3 weeks: 3/8, 3/15, 3/22*) [{{courses:theory2017:ch1_notes.pdf|notes}}, {{courses:theory2017:ch1_slides.pdf|slides}}, appendix:{{courses:theory2017:ch1_minimization.pdf|minimization}}] | ||
*Context-Free Languages and Pushdown Automata (2 weeks: 3/29, 4/12*) [{{courses:theory2017:ch2_notes.pdf|notes}},{{courses:theory2017:ch2_slides.pdf|slides}}] | *Context-Free Languages and Pushdown Automata (2 weeks: 3/29, 4/12*) [{{courses:theory2017:ch2_notes.pdf|notes}},{{courses:theory2017:ch2_slides.pdf|slides}}] | ||
- | * **Midterm** (**2017/04/19**) | + | *Turing Machines (2 weeks: 4/19, 5/3) [{{courses:theory2017:ch3_notes.pdf|notes}}, {{courses:theory2017:ch3_slides.pdf|slides}}] |
- | *Turing Machines (2 weeks: 4/26, 5/3) [{{courses:theory2017:ch3_notes.pdf|notes}}, {{courses:theory2017:ch3_slides.pdf|slides}}] | + | * **Midterm** (**2017/04/26**) |
*Decidability (and Undecidability) (1 week: 5/10*) [{{courses:theory2017:ch4_notes.pdf|notes}}, {{courses:theory2017:ch4_slides.pdf|slides}}] | *Decidability (and Undecidability) (1 week: 5/10*) [{{courses:theory2017:ch4_notes.pdf|notes}}, {{courses:theory2017:ch4_slides.pdf|slides}}] | ||
*Reducibility (2 weeks: 5/17, 5/24) [{{courses:theory2017:ch5_notes.pdf|notes}}, {{courses:theory2017:ch5_slides.pdf|slides}}] | *Reducibility (2 weeks: 5/17, 5/24) [{{courses:theory2017:ch5_notes.pdf|notes}}, {{courses:theory2017:ch5_slides.pdf|slides}}] |