CS 236 Class Schedule
Winter 2025
NOTE: This schedule is tentative and subject to change
| Jan 6 | |
| Jan 7 | |
| Jan 8 |
Introduction and Course Overview
Lexical Analysis, Tokens, Scanning |
| Jan 9 | |
| Jan 10 |
Read 13.3 (first 2 pages), 13.4 (first 2 pages)
Regular Expressions |
| Jan 13 |
Read 13.2 (all 5 pages), 13.3 (first 6 pages)
State Machines |
| Jan 14 | |
| Jan 15 |
Add/Drop Deadline
Read 13.1 (first 4 pages) Grammars |
| Jan 16 | |
| Jan 17 |
Read 13.1 (last 4 pages)
Derivations, Parse Trees |
| Jan 20 |
Holiday
|
| Jan 21 | |
| Jan 22 |
Read
Ambiguous grammar
Ambiguous Grammars |
| Jan 23 | |
| Jan 24 |
Table-Driven Parsing
|
| Jan 27 |
Read
Recursive descent parser
Recursive-Descent Parsing |
| Jan 28 | |
| Jan 29 |
Read 1.1 (all 12 pages), 1.2 (first 2 pages)
Logical Expressions |
| Jan 30 | |
| Jan 31 |
Read 1.3 (first 6 pages)
Tautologies Logical Equivalences |
| Feb 3 |
Read 1.6 (first 6 pages)
Proof by Deduction |
| Feb 4 | |
| Feb 5 |
Read 1.7 (pages 90 and 91)
Proof by Contradiction Read 5.1 (first 9 pages) Proof by Induction |
| Feb 6 | |
| Feb 7 |
Read 1.4 (first 8 pages)
Predicates Quantifiers |
| Feb 10 |
Read 1.5 (first 4 pages)
Nested Quantifiers Read 1.4,1.5 (pages 52, 53, and 66) Translating English |
| Feb 11 | |
| Feb 12 |
Read 1.4 (pages 49 to 51)
Predicate Logic Algebra Read 1.6 (page 78, Resolution) Resolution |
| Feb 13 | |
| Feb 14 |
Read 1.4 (last 2 pages), 1.6 (last 3 pages)
Proofs with Facts and Rules |
| Feb 17 |
Holiday
|
| Feb 18 | No Class (Monday instruction) |
| Feb 19 |
Read 1.4 (last 2 pages), 1.6 (last 3 pages)
Resolution with Facts and Rules |
| Feb 20 | |
| Feb 21 |
Midterm Exam Review
|
| Feb 24 |
Midterm Exam Review
|
| Feb 25 |
Midterm Exam (Feb 25-26) (on Learning Suite)
|
| Feb 26 |
Midterm Exam (Feb 25-26) (on Learning Suite)
Read 2.1 (first 10 pages), 2.2 (first 6 pages) Sets and Set Operations Read 9.2 (first 3 pages) Relational Data Model |
| Feb 27 | |
| Feb 28 |
Read 9.2 (next 3 pages)
Relational Algebra |
| Mar 3 |
Read
Relational algebra (through Natural Join)
Relational Algebra |
| Mar 4 | |
| Mar 5 |
Read
Deductive database
Deductive Databases |
| Mar 6 | |
| Mar 7 |
Read 2.1 (page 128), 2.2 (last 3 pages)
Power Sets |
| Mar 10 |
Read 9.1 (first 4 pages), 9.3 (all 5 pages)
Binary Relations Read 9.1 (next 3 pages) Reflexive, Symmetric, Transitive |
| Mar 11 | |
| Mar 12 |
Read 9.4 (first 2 pages)
Closures |
| Mar 13 | |
| Mar 14 |
Read 9.5 (all 8 pages)
Equivalence Relations Read 9.6 (first 7 pages) Partial Orders |
| Mar 17 |
Read 2.3 (first 7 pages, last 1 page)
Functions |
| Mar 18 | |
| Mar 19 |
Read 10.1 (first 4 pages), 10.2 (first 4 pages), 10.4 (first 8 pages)
Graphs Read 10.3 (first 3 pages) Adjacency Lists |
| Mar 20 | |
| Mar 21 |
No Class
|
| Mar 24 |
Read
Algorithms: Section 3.2 DFS in undirected graphs (5 pages)
Depth-First Search |
| Mar 25 | |
| Mar 26 |
Read
Algorithms: Section 3.3 DFS in directed graphs (4 pages)
Depth-First Search Trees |
| Mar 27 | |
| Mar 28 |
Read
Algorithms: Section 3.4 Strongly connected components (4 pages)
Strongly Connected Components |
| Mar 31 |
Read 10.3 (first 3 pages)
Adjacency Matrices |
| Apr 1 | |
| Apr 2 |
Read 9.4 (last 4 pages)
Warshall's Algorithm |
| Apr 3 |
Withdraw Deadline
|
| Apr 4 |
Read
Floyd-Warshall algorithm
Floyd's Algorithm |
| Apr 7 |
Read 10.6 (first 6 pages)
Dijkstra's Algorithm |
| Apr 8 | |
| Apr 9 |
Read 11.4 (first 2 pages)
Spanning Trees Read Kruskal's algorithm Kruskal's Algorithm |
| Apr 10 | |
| Apr 11 |
Read
Prim's algorithm
Prim's Algorithm |
| Apr 14 |
Final Exam Review
|
| Apr 15 | |
| Apr 16 |
Last day to submit work
Final Exam Review |
| Apr 17 |
Reading Day
|
| Apr 18 |
Final Exam (on Learning Suite)
|
| Apr 19 (Sat) |
Final Exam (on Learning Suite)
|
| Apr 21 |
Final Exam (on Learning Suite)
|
| Apr 22 |
Final Exam (on Learning Suite)
|
| Apr 23 | |
| Apr 24 | |
| Apr 25 | |