User Tools
courses:theory2024:main
Differences
This shows you the differences between two versions of the page.
|
courses:theory2024:main [2024/02/27 12:22] tsay2 [Announcements] |
courses:theory2024:main [2024/06/19 11:59] (current) tsay2 [Announcements] |
||
|---|---|---|---|
| Line 3: | Line 3: | ||
| =====Announcements===== | =====Announcements===== | ||
| + | * 06/17: grade report available; contact the instructor by 5PM 06/18 (Tuesday) if you have any question or request. | ||
| + | * 05/29: slides from TA sessions: {{courses:theory2024:hw1-2_s.pdf|HW#1-2}}, {{courses:theory2024:hw3-5_s.pdf|HW#3-5}}, {{courses:theory2024:hw6-7_s.pdf|HW#6-7}}, {{courses:theory2024:hw8-10_s.pdf|HW#8-10}}. | ||
| + | * 05/21: {{courses:theory2024:hw10.pdf|HW#10}} due 1:20PM 05/28. | ||
| + | * 05/14: notes/slides for Time Complexity and NP-Completeness available. | ||
| + | * 05/07: {{courses:theory2024:hw9.pdf|HW#9}} due 2:20PM 05/14. | ||
| + | * 05/07: notes/slides for Reducibility available. | ||
| + | * 04/30: {{courses:theory2024:hw8.pdf|HW#8}} due 2:20PM 05/07. | ||
| + | * 04/29: {{courses:theory2024:theory2024mid_s.pdf|Suggested Solutions to Midterm Problems}} available (revised 04/30). | ||
| + | * 04/23: notes/slides for Decidability available. | ||
| + | * 04/23: {{courses:theory2024:hw7.pdf|HW#7}} due 1:20PM 04/30. | ||
| + | * 04/16: notes/slides for Turing Machines available. | ||
| + | * 04/02: old exams: {{courses:theory:old_exams.zip|2000-2023}}. (Note: I didn't offer the course some of the years.) | ||
| + | * 04/01: {{courses:theory2024:hw6.pdf|HW#6}} due 2:20PM 04/16. | ||
| + | * 03/25: {{courses:theory2024:hw5.pdf|HW#5}} due 1:20PM 04/02. | ||
| + | * 03/18: {{courses:theory2024:hw4.pdf|HW#4}} due 03/26. | ||
| + | * 03/18: notes/slides for Context-Free Languages and Pushdown Automata available. | ||
| + | * 03/10: {{courses:theory2024:hw3.pdf|HW#3}} due on 03/19. | ||
| + | * 03/04: {{courses:theory2024:hw2.pdf|HW#2}} due on 03/12. | ||
| * 02/27: notes/slides for Finite Automata and Regular Languages available. | * 02/27: notes/slides for Finite Automata and Regular Languages available. | ||
| * 02/27: {{courses:theory2024:hw1.pdf|HW#1}} due on 03/05. | * 02/27: {{courses:theory2024:hw1.pdf|HW#1}} due on 03/05. | ||
| Line 39: | Line 57: | ||
| * **Midterm** (**2024/04/09**) | * **Midterm** (**2024/04/09**) | ||
| *Turing Machines (1.5 weeks: 04/16, 04/23a) [{{courses:theory2024:ch3_notes.pdf|notes}}, {{courses:theory2024:ch3_slides.pdf|slides}}] | *Turing Machines (1.5 weeks: 04/16, 04/23a) [{{courses:theory2024:ch3_notes.pdf|notes}}, {{courses:theory2024:ch3_slides.pdf|slides}}] | ||
| - | *Decidability (and Undecidability) (2 weeks: 04/23b, 04/30*, 05/07a) [{{courses:theory2024:ch4_notes.pdf|notes}}, {{courses:theory2024:ch4_slides.pdf|slides}}] | + | *Decidability (and Undecidability) (1.5 weeks: 04/23b, 04/30*) [{{courses:theory2024:ch4_notes.pdf|notes}}, {{courses:theory2024:ch4_slides.pdf|slides}}] |
| - | *Reducibility (1.5 weeks: 05/07b, 05/14) [{{courses:theory2024:ch5_notes.pdf|notes}}, {{courses:theory2024:ch5_slides.pdf|slides}}] | + | *Reducibility (1.5 weeks: 05/07, 05/14a) [{{courses:theory2024:ch5_notes.pdf|notes}}, {{courses:theory2024:ch5_slides.pdf|slides}}] |
| - | *Time Complexity and NP-Completeness (2 weeks: 05/21, 05/28*) [{{courses:theory2024:ch7a_notes.pdf|notes}}, {{courses:theory2024:ch7a_slides.pdf|slides}}] | + | *Time Complexity and NP-Completeness (2.5 weeks: 05/14b, 05/21, 05/28*) [{{courses:theory2024:ch7a_notes.pdf|notes}}, {{courses:theory2024:ch7a_slides.pdf|slides}}; supplementary: {{courses:theory2024:ch7b_notes.pdf|notes}}, {{courses:theory2024:ch7b_slides.pdf|slides}}] |
| * **Final** (**2024/06/04**) | * **Final** (**2024/06/04**) | ||
courses/theory2024/main.1709007751.txt.gz · Last modified: 2024/02/27 12:22 by tsay2
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported
