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