This shows you the differences between two versions of the page.
courses:theory2015:main [2015/05/13 00:06] tsay [Announcements] |
courses:theory2015:main [2016/05/04 11:15] (current) tsay [Announcements] |
||
---|---|---|---|
Line 4: | Line 4: | ||
=====Announcements===== | =====Announcements===== | ||
+ | * 07/13: grade report available; please send inquiries, if any, to the instructor by 2PM 07/14. | ||
+ | * 06/18: slides from TA sessions: {{courses:theory2015:toc_ta3.pptx|HW#6-7}}, {{courses:theory2015:toc_ta4.pptx|HW#8-10}}. | ||
+ | * 06/03: {{courses:theory2015:hw10.pdf|HW#10}} due on 06/10. | ||
+ | * 05/27: {{courses:theory2015:hw9.pdf|HW#9}} due on 06/03. | ||
+ | * 05/27: notes/slides for Time Complexity and NP-Completeness available. | ||
+ | * 05/19: {{courses:theory2015:theory2015mid_s.pdf|Suggested Solutions to Midterm Problems}} available. | ||
+ | * 05/13: TA session of 05/27 moved one week earlier to 05/20. | ||
+ | * 05/13: notes/slides for Reducibility available. | ||
* 05/13: {{courses:theory2015:hw8.pdf|HW#8}} due on 05/20. | * 05/13: {{courses:theory2015:hw8.pdf|HW#8}} due on 05/20. | ||
* 05/06: {{courses:theory2015:hw7.pdf|HW#7}} due on 05/13. | * 05/06: {{courses:theory2015:hw7.pdf|HW#7}} due on 05/13. | ||
Line 49: | Line 57: | ||
(Note: a TA | (Note: a TA | ||
session will precede a class meeting whose date is marked with an *. There | session will precede a class meeting whose date is marked with an *. There | ||
- | are four TA sessions on 3/25, 4/15, 5/27, and 6/10.) | + | are four TA sessions on 3/25, 4/15, 5/20, and 6/10.) |
*Introduction and Mathematical Preliminaries (2 weeks: 2/25, 3/4) [{{courses:theory2015:ch0_notes.pdf|notes}}, {{courses:theory2015:ch0_slides.pdf|slides}}] | *Introduction and Mathematical Preliminaries (2 weeks: 2/25, 3/4) [{{courses:theory2015:ch0_notes.pdf|notes}}, {{courses:theory2015:ch0_slides.pdf|slides}}] | ||
*Finite Automata and Regular Languages (3 weeks: 3/11, 3/18, 3/25*) [{{courses:theory2015:ch1_notes.pdf|notes}}, {{courses:theory2015:ch1_slides.pdf|slides}}] | *Finite Automata and Regular Languages (3 weeks: 3/11, 3/18, 3/25*) [{{courses:theory2015:ch1_notes.pdf|notes}}, {{courses:theory2015:ch1_slides.pdf|slides}}] | ||
Line 55: | Line 63: | ||
* **Midterm** (**2015/04/22**) | * **Midterm** (**2015/04/22**) | ||
*Turing Machines (2 weeks: 4/29, 5/6) [{{courses:theory2015:ch3_notes.pdf|notes}}, {{courses:theory2015:ch3_slides.pdf|slides}}] | *Turing Machines (2 weeks: 4/29, 5/6) [{{courses:theory2015:ch3_notes.pdf|notes}}, {{courses:theory2015:ch3_slides.pdf|slides}}] | ||
- | *Decidability and Undecidability (2 weeks: 5/13, 5/20) [{{courses:theory2015:ch4_notes.pdf|notes}}, {{courses:theory2015:ch4_slides.pdf|slides}}] | + | *Decidability and Undecidability (1 week: 5/13) [{{courses:theory2015:ch4_notes.pdf|notes}}, {{courses:theory2015:ch4_slides.pdf|slides}}] |
- | *Reducibility (1.5 weeks: 5/27*, 6/3a) [{{courses:theory2015:ch5_notes.pdf|notes}}, {{courses:theory2015:ch5_slides.pdf|slides}}] | + | *Reducibility (2 weeks: 5/20*, 5/27) [{{courses:theory2015:ch5_notes.pdf|notes}}, {{courses:theory2015:ch5_slides.pdf|slides}}] |
- | *Time Complexity and NP-Completeness (2.5 weeks: 6/3b, 6/10*, 6/17) [{{courses:theory2015:ch7_notes.pdf|notes}}, {{courses:theory2015:ch7_slides.pdf|slides}}] | + | *Time Complexity and NP-Completeness (3 weeks: 6/3, 6/10*, 6/17) [{{courses:theory2015:ch7_notes.pdf|notes}}, {{courses:theory2015:ch7_slides.pdf|slides}}] |
* **Final** (**2015/06/24**) | * **Final** (**2015/06/24**) | ||