| A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | ||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1 | |||||||||||||||||
2 | Lectures | Deadlines | |||||||||||||||
3 | |||||||||||||||||
4 | Monday | Wednesday | Friday | * All deadlines are tentative. | |||||||||||||
5 | |||||||||||||||||
6 | Week 1 Jan. 5 - 9 | Jan 5 | Introduction, Set Theory | 7 | Mathematical Proofs | 9 | Indirect Proofs | Problem Set #0 Due Friday, Jan. 9, 1:00 PM | |||||||||
7 | |||||||||||||||||
8 | |||||||||||||||||
9 | Week 2 Jan. 12 - 16 | 12 | Propositional Logic ★ Test run of PollEV | 14 | First-Order Logic (1 of 2) ★ First official PollEV | 16 | First-Order Logic (2 of 2) | Problem Set #1 Due Friday, Jan. 16, 1:00 PM | |||||||||
10 | |||||||||||||||||
11 | |||||||||||||||||
12 | Week 3 Jan. 19 - 23 | 19 | No Class Holiday | 21 | Functions (1 of 2) | 23 | Functions (2 of 2) | Problem Set #2 Due Friday, Jan. 23, 1:00 PM | |||||||||
13 | |||||||||||||||||
14 | |||||||||||||||||
15 | Week 4 Jan. 26 - 30 | 26 | Set Theory Revisited ★ Post Participation Opt-Out Form 1 PM | 28 | Graphs (1 of 3) | 30 | Graphs (2 of 3) ★ Participation Opt-Out Due 11:59 PM | Problem Set #3 Due Friday, Jan. 30, 1:00 PM | |||||||||
16 | |||||||||||||||||
17 | |||||||||||||||||
18 | Week 5 Feb. 2 - 6 | Feb 2 | Graphs (3 of 3) | 3 | Midterm Tuesday, 7 - 10 PM | 4 | Mathematical Induction (1 of 2) | 6 | Mathematical Induction (2 of 2) | Problem Set #4 Due Friday, Feb. 6, 1:00 PM | |||||||
19 | !! | ||||||||||||||||
20 | |||||||||||||||||
21 | Week 6 Feb. 9 - 13 | 9 | Finite Automata (1 of 3) | 11 | Finite Automata (2 of 3) | 13 | Finite Automata (3 of 3) | Problem Set #5 Due Friday, Feb. 13, 1:00 PM | |||||||||
22 | |||||||||||||||||
23 | |||||||||||||||||
24 | Week 7 Feb. 16 - 20 | 16 | No Class Holiday | 18 | Regular Expressions | 20 | Nonregular Languages | Problem Set #6 Due Friday, Feb. 20, 1:00 PM | |||||||||
25 | |||||||||||||||||
26 | |||||||||||||||||
27 | Week 8 Feb. 23 - 27 | 23 | Context-Free Languages | 25 | Turing Machines (1 of 3) | 27 | Turing Machines (2 of 3) ★ WD / GB Deadline, 5 PM | Problem Set #7 Due Friday, Feb. 27, 1:00 PM | |||||||||
28 | |||||||||||||||||
29 | |||||||||||||||||
30 | Week 9 Mar. 2 - 6 | Mar 2 | Turing Machines (3 of 3) | 4 | Unsolvable Problems (1 of 2) | 6 | Unsolvable Problems (2 of 2) | Problem Set #8 Due Friday, March 6, 1:00 PM | |||||||||
31 | |||||||||||||||||
35 | |||||||||||||||||
36 | Week 10 Mar. 9 - 13 | 9 | Complexity Theory (1 of 2) | 11 | Complexity Theory (2 of 2) | 13 | Course Wrap | Problem Set #9 Due Friday, March 13, 1:00 PM | |||||||||
37 | |||||||||||||||||
38 | |||||||||||||||||
39 | Week 11 Mar. 16 - 20 | 16 | Classes have ended. | 18 | Final Exam Wednesday, 3:30 - 6:30 PM | 20 | Classes have ended. | ||||||||||
40 | !! | ||||||||||||||||
41 | |||||||||||||||||
42 | * Note: Final exam period is March 16 - 20 (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 24. See Stanford's academic calendar for more. | ||||||||||||||||