User Tools
courses:theory2013:main
Differences
This shows you the differences between two versions of the page.
|
courses:theory2013:main [2013/05/01 10:58] tsay |
courses:theory2013:main [2014/06/29 11:01] (current) tsay [Announcements] |
||
|---|---|---|---|
| Line 5: | Line 5: | ||
| =====Announcements===== | =====Announcements===== | ||
| + | * 06/30: grade report available; please send inquiries, if any, to the instructor by 2PM July 02. | ||
| + | * 06/14: slides from TA sessions: {{courses:theory2013:hw5slides.pptx|HW#5}}, {{courses:theory2013:hw6slides.pptx|HW#6}}, {{courses:theory2013:hw7slides.pptx|HW#7}}, {{courses:theory2013:hw8slides.pptx|HW#8}}, {{courses:theory2013:hw9slides.pptx|HW#9}}, {{courses:theory2013:hw10slides.pptx|HW#10}}. | ||
| + | * 06/06: the TA session rescheduled on 06/10 will be held in the same classroom. (There might be other students in the room waiting for the class starting from 2:20PM, but we have officially booked the room for 1:20-2:10PM.) | ||
| + | * 06/06: check out revised Slide 56 of Time Complexity and NP-Completeness. | ||
| + | * 05/29: reminder: there will be a TA session on 06/05. | ||
| + | * 05/22: {{courses:theory2013:hw10.pdf|HW#10}} due on 05/29. | ||
| + | * 05/22: notes/slides for Time Complexity and NP-Completeness available. | ||
| + | * 05/16: reminder: there will be a TA session on 05/22. | ||
| + | * 05/15: {{courses:theory2013:hw9.pdf|HW#9}} due on 05/22. | ||
| + | * 05/15: notes/slides for Reducibility available. | ||
| + | * 05/13: {{courses:theory2013:theory2013mid_s.pdf|Suggested Solutions to Midterm Problems}} available. | ||
| + | * 05/07: {{courses:theory2013:hw8.pdf|HW#8}} due on 05/15. | ||
| * 05/01: notes/slides for Decidability and Undecidability available. | * 05/01: notes/slides for Decidability and Undecidability available. | ||
| * 04/24: {{courses:theory2013:hw7.pdf|HW#7}} due on 05/01. | * 04/24: {{courses:theory2013:hw7.pdf|HW#7}} due on 05/01. | ||
| Line 60: | Line 72: | ||
| *Context-Free Languages and Pushdown Automata (2 weeks: 3/27, 4/10*) [{{courses:theory2013:ch2_notes.pdf|notes}},{{courses:theory2013:ch2_slides.pdf|slides}}] | *Context-Free Languages and Pushdown Automata (2 weeks: 3/27, 4/10*) [{{courses:theory2013:ch2_notes.pdf|notes}},{{courses:theory2013:ch2_slides.pdf|slides}}] | ||
| * **Midterm** (**2013/04/17**) | * **Midterm** (**2013/04/17**) | ||
| - | *Turing Machines (2 weeks: 4/24, 5/1) [{{courses:theory2013:ch3_notes.pdf|notes}}, {{courses:theory2013:ch3_slides.pdf|slides}}] | + | *Turing Machines (1.5 weeks: 4/24, 5/1a) [{{courses:theory2013:ch3_notes.pdf|notes}}, {{courses:theory2013:ch3_slides.pdf|slides}}] |
| - | *Decidability and Undecidability (1.5 weeks: 5/8, 5/15a) [{{courses:theory2013:ch4_notes.pdf|notes}}, {{courses:theory2013:ch4_slides.pdf|slides}}] | + | *Decidability and Undecidability (2 weeks: 5/1b, 5/8, 5/15a) [{{courses:theory2013:ch4_notes.pdf|notes}}, {{courses:theory2013:ch4_slides.pdf|slides}}] |
| *Reducibility (1.5 weeks: 5/15b, 5/22*) [{{courses:theory2013:ch5_notes.pdf|notes}}, {{courses:theory2013:ch5_slides.pdf|slides}}] | *Reducibility (1.5 weeks: 5/15b, 5/22*) [{{courses:theory2013:ch5_notes.pdf|notes}}, {{courses:theory2013:ch5_slides.pdf|slides}}] | ||
| *Time Complexity and NP-Completeness (2 weeks: 5/29, 6/5*) [{{courses:theory2013:ch7_notes.pdf|notes}}, {{courses:theory2013:ch7_slides.pdf|slides}}] | *Time Complexity and NP-Completeness (2 weeks: 5/29, 6/5*) [{{courses:theory2013:ch7_notes.pdf|notes}}, {{courses:theory2013:ch7_slides.pdf|slides}}] | ||
courses/theory2013/main.1367377097.txt.gz · Last modified: 2013/05/01 10:58 by tsay
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported
