| A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | ||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1 | e | ||||||||||||||||
2 | Lectures | Deadlines | |||||||||||||||
3 | |||||||||||||||||
4 | Monday | Wednesday | Friday | * All deadlines are tentative. | |||||||||||||
5 | |||||||||||||||||
6 | Week 1 Jan. 6 - 10 | Jan 6 | Introduction, Set Theory | 8 | Mathematical Proofs | 10 | Indirect Proofs | Problem Set #0 Due Friday, Jan. 10 1:00 PM | |||||||||
7 | |||||||||||||||||
8 | |||||||||||||||||
9 | Week 2 Jan. 13 - 17 | 13 | Propositional Logic ⭐ Test run of PollEV | 15 | First-Order Logic (1 of 2) ⭐ First official PollEV (?) | 17 | First-Order Logic (2 of 2) | Problem Set #1 Due Friday, Jan. 17 1:00 PM | |||||||||
10 | |||||||||||||||||
11 | |||||||||||||||||
12 | Week 3 Jan. 20 - 24 | 20 | No Class Holiday | 22 | Functions (1 of 2) | 24 | Functions (2 of 2) | Problem Set #2 Due Friday, Jan. 24 1:00 PM | |||||||||
13 | |||||||||||||||||
14 | |||||||||||||||||
15 | Week 4 Jan. 27 - 31 | 27 | Set Theory Revisited | 29 | Graphs (1 of 3) | 31 | Graphs (2 of 3) | Problem Set #3 Due Friday, Jan. 31 1:00 PM | |||||||||
16 | |||||||||||||||||
17 | |||||||||||||||||
18 | Week 5 Feb. 3 - 7 | Feb 3 | Graphs (3 of 3) | 4 | Midterm 1 Tuesday (!!) 7 - 9 PM | 5 | Mathematical Induction (1 of 2) | 7 | Mathematical Induction (2 of 2) | Problem Set #4 Due Friday, Feb. 7 1:00 PM | |||||||
19 | !! | ||||||||||||||||
20 | |||||||||||||||||
21 | Week 6 Feb. 10 - 14 | 10 | Finite Automata (1 of 3) | 12 | Finite Automata (2 of 3) | 14 | Finite Automata (3 of 3) | Problem Set #5 Due Friday, Feb. 14 1:00 PM | |||||||||
22 | |||||||||||||||||
23 | |||||||||||||||||
24 | Week 7 Feb. 17 - 21 | 17 | No Class Holiday | 19 | Regular Expressions | 21 | Nonregular Languages | Problem Set #6 Due Friday, Feb. 21 1:00 PM | |||||||||
25 | |||||||||||||||||
26 | |||||||||||||||||
27 | Week 8 Feb. 24 - 28 | 24 | Context-Free Languages | 25 | Midterm 2 Tuesday (!!) 7 - 9 PM | 26 | Turing Machines (1 of 3) | 28 | Turing Machines (2 of 3) ★ Withdrawal Deadline, 5 PM ★ Grading Basis Deadline, 5 PM | Problem Set #7 Due Friday, Feb. 28 1:00 PM | |||||||
28 | !! | ||||||||||||||||
29 | |||||||||||||||||
30 | Week 9 Mar. 3 - 7 | Mar 3 | Turing Machines (3 of 3) | 5 | Unsolvable Problems (1 of 2) | 7 | Unsolvable Problems (2 of 2) | Problem Set #8 Due Friday, Mar. 7 1:00 PM | |||||||||
31 | |||||||||||||||||
35 | |||||||||||||||||
36 | Week 10 Mar. 10 - 14 | 10 | Complexity Theory (1 of 2) | 12 | Complexity Theory (2 of 2) | 14 | Course Wrap | Problem Set #9 Due Friday, Mar. 14 1:00 PM | |||||||||
37 | |||||||||||||||||
38 | |||||||||||||||||
39 | Week 11 Mar. 17 - 21 | 17 | Classes have ended. | 19 | Final Exam Wednesday, 3:30 - 6:30 PM | 21 | Classes have ended. | ||||||||||
40 | !! | ||||||||||||||||
41 | |||||||||||||||||
42 | * Note: Final exam period is March 17 - 21 (Mon - Fri). Final exam dates and times are set by the registrar and will not change. | ||||||||||||||||
43 | * Note: Grades due to Registrar by 11:59 PM on Tuesday, March 25. See Stanford's academic calendar for more. | ||||||||||||||||