Computer Science 236

CS 236 Class Schedule

Summer 2026


NOTE: This schedule is tentative and subject to change

Jun 22 Introduction and Course Overview

Lexical Analysis, Tokens, Scanning

Read 13.3 (first 2 pages), 13.4 (first 2 pages)
Regular Expressions
Jun 23  
Jun 24 Read 13.2 (all 5 pages), 13.3 (first 6 pages)
State Machines

Read 13.1 (first 4 pages)
Grammars
Jun 25  
Jun 26 Read 13.1 (last 4 pages)
Derivations, Parse Trees

Read Ambiguous grammar
Ambiguous Grammars
Jun 29 Add/Drop Deadline

Table-Driven Parsing

Read Recursive descent parser
Recursive-Descent Parsing
Jun 30  
Jul 1 Read 1.1 (all 12 pages), 1.2 (first 2 pages)
Logical Expressions

Read 1.3 (first 6 pages)
Tautologies
Logical Equivalences
Jul 2  
Jul 3 Holiday
No Class
Jul 6 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 7  
Jul 8 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 9  
Jul 10 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 13 Midterm Exam Review

Jul 14 Midterm Exam (Jul 14-15) (on Learning Suite)

Jul 15 Midterm Exam (Jul 14-15) (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

Read 9.2 (next 3 pages)
Relational Algebra
Jul 16  
Jul 17 Read Relational algebra (through Rename)
Read Join (relational algebra) (through Natural Join)
Relational Algebra

Read Deductive database
Deductive Databases
Jul 20 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 21  
Jul 22 Read 9.4 (first 2 pages)
Closures

Read 9.5 (all 8 pages)
Equivalence Relations
Read 9.6 (first 7 pages)
Partial Orders
Jul 23  
Jul 24 Holiday
No Class
Jul 27 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 28 Withdraw Deadline
Jul 29 Read Algorithms: Section 3.3 DFS in directed graphs (4 pages)
Depth-First Search Trees

Jul 30  
Jul 31 Read Algorithms: Section 3.4 Strongly connected components (4 pages)
Strongly Connected Components

Aug 3 Read 10.3 (first 3 pages)
Adjacency Matrices

Read 9.4 (last 4 pages)
Warshall's Algorithm

Aug 4  
Aug 5 Read Floyd-Warshall algorithm
Floyd's Algorithm

Read 10.6 (first 6 pages)
Dijkstra's Algorithm

Aug 6  
Aug 7 Read 11.4 (first 2 pages)
Spanning Trees

Read Kruskal's algorithm
Kruskal's Algorithm

Read Prim's algorithm
Prim's Algorithm

Aug 10 Last day to submit work

Final Exam Review
Aug 11 Reading Day
Aug 12 Final Exam (on Learning Suite)
Aug 13
Aug 14