search
Differences
This shows you the differences between two versions of the page.
| Next revision | Previous revision | ||
|
cs-236:spring-2019-schedule [2019/04/18 17:47] pdiddy created |
cs-236:spring-2019-schedule [2019/06/11 14:34] (current) pdiddy Pushed a lab due date back to work around an exam grading push |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | This schedule is unfinished. | + | This schedule is subject to change. |
| - | + | ||
| - | <html><!--This schedule is subject to change.--></html> | + | |
| ^ Date ^ Topic ^ Reading ^ Due ^ | ^ Date ^ Topic ^ Reading ^ Due ^ | ||
| - | | Sep 5 | Course overview, sets | | | | + | | May 1 | Course overview, sets, strings, and languages | [[Syllabus]], 2.1, 2.2, 2.3 | | |
| - | | Sep 7 | sets, strings, and languages | 2.1, 2.2, 2.3 | | | + | | May 3 | Languages and expressiveness; finite state machines | 13.2, 13.3 | [[Homework 0]] | |
| - | | Sep 10 | Languages and expressiveness; finite state machines with single outputs | 13.2 | [[Homework 0]] | | + | | May 6 | Regular expressions and FSMs, [[Lexical Analyzer]] | 13.4, [[Lexical Analyzer]], [[Lectures | scanner-algorithm.pptx]] | [[Homework 1]] | |
| - | | Sep 12 | Finite state machines, multiple outputs, no output, and regular expressions | 13.3 | | | + | | May 8 | Grammars, derivations, and parse trees | 13.1, [[Lectures | top-down-parsing.pptx]] | [[Homework 2]] | |
| - | | Sep 14 | Regular expressions and FSMs | 13.1, 13.4 | [[Homework 1]] | | + | | May 10 | Top-down parsing, [[Datalog Parser]] | [[Lectures | top-down-parsing.pptx]], [[Datalog Parser]] | |
| - | | Sep 17 | [[Lexical Analyzer]] See [[Lectures | scanner-algorithm.pptx]] | [[Lexical Analyzer]] | | | + | | May 13 | Propositional logic, logical equivalences, tautologies, and contradictions | 1.1, 1.2, 1.3 | [[Homework 3]] | |
| - | | Sep 19 | Grammars, derivations | | [[Homework 2]] | | + | | May 14 | | | [[Lexical Analyzer]] | |
| - | | Sep 21 | Parse trees | [[Lectures | top-down-parsing.pptx]] | | | + | | May 15 | Predicates, quantifiers, and their logical equivalences | 1.4 | [[Homework 4]] | |
| - | | Sep 24 | Top-down parsing (recursive descent, removing left-recursion, LL(1)) See [[Lectures | top-down-parsing.pptx]] | | | + | | May 17 | Validity, equivalences, logical implications, and derivations; Inference and resolution | 1.6 | | |
| - | | Sep 26 | [[Datalog Parser]] | [[Datalog Parser]] | | | + | | May 20 | Inference and resolution, continued; Datalog queries with resolution | 1.7 | [[Homework 5]], [[Exams | Midterm 1]] | |
| - | | Sep 28 | Propositional logic | 1.1, 1.2 | [[Homework 3]] | | + | | May 21 | | | [[Datalog Parser | Datalog Parser Part 1]] | |
| - | | Oct 1 | Logical equivalences, tautologies, and contradictions | 1.3 | | | + | | May 22 | Relations, [[Relational Database]] | 9.1, 9.2, [[Relational Database]] | | |
| - | | Oct 2 | | | [[Lexical Analyzer]] | | + | | May 24 | Relational algebra, closures, equivalence relations | 9.3, 9.4, 9.5, [[Lectures | relational-algebra.pptx]] | [[Homework 6]] | |
| - | | Oct 3 | Predicates and quantifiers | 1.4 | [[Homework 4]] | | + | | May 27 | Memorial Day holiday | | | |
| - | | Oct 5 | Predicate logic equivalences | | | | + | | May 28 | | | [[Datalog Parser | Datalog Parser Part 2]], [[Homework 7]] | |
| - | | Oct 8 | Validity, equivalences, logical implications, and derivations | 1.6 | | | + | | May 29 | [[Datalog Interpreter]], Equivalence relations and partial orders | 9.6, [[Datalog Interpreter]] | | |
| - | | Oct 9 | | | [[Datalog Parser | Datalog Parser Part 1]] | | + | | May 30 | | | [[Relational Database | Relational Database Part 1]] | |
| - | | Oct 10 | Inference and resolution with predicate calculus and derivations | 1.7 | [[Homework 5]] | | + | | May 31 | Graphs, adjacency lists, matrices | 10.1, 10.3 | [[Homework 8]] | |
| - | | Oct 12 | Inference and resolution with predicate calculus and derivations | | [[Exams | Midterm 1]] | | + | | June 3 | Warshall's algorithm, Floyd's algorithm; Depth-first search, breadth first search | 10.4 | [[Exams | Midterm 2]] | |
| - | | Oct 15 | Solving Datalog queries with resolution and proof by contradiction | | | | + | | June 4 | | | [[Relational Database | Relational Database Part 2]] | |
| - | | Oct 16 | | | [[Datalog Parser | Datalog Parser Part 2]] | | + | | June 5 | Strongly connected components, [[Optimizing Rule Evaluation]] | [[Optimizing Rule Evaluation]] | | |
| - | | Oct 17 | Relations | 9.1, 9.2 | | | + | | June 7 | Dijkstra's Algorithm; Trees | 10.6, 11.1, 11.2 | [[Datalog Interpreter | Datalog Interpreter Part 1]] | |
| - | | Oct 19 | [[Relational Database]] | [[Relational Database]] | | | + | | June 10 | Tree traversal, spanning trees | 11.3, 11.4 | [[Homework 9]] | |
| - | | Oct 22 | Relational algebra | 9.3, [[Lectures | relational-algebra.pptx]] | | | + | | June 12 | Minimal spanning trees; Induction | 11.5, 5.1, 5.2, 5.3 | | |
| - | | Oct 24 | Closures, equivalence relations | 9.4, 9.5 | [[Homework 6]] | | + | | June 14 | Induction, continued | 5.4, 5.5 | [[Datalog Interpreter | Datalog Interpreter Part 2]], [[Optimizing Rule Evaluation | Optimizing Rule Evaluation Part 1]], [[Homework 10]] | |
| - | | Oct 26 | Relational databases | | | | + | | June 15 | | | [[Homework 11]] | |
| - | | Oct 29 | [[Datalog Interpreter]] | [[Datalog Interpreter]] | | | + | | June 17 | Course wrap-up | | [[Optimizing Rule Evaluation | Optimizing Rule Evaluation Part 2]] | |
| - | | Oct 30 | | | [[Relational Database | Relational Database Part 1]] | | + | |
| - | | Oct 31 | Equivalence relations and partial orders | 9.6 | [[Homework 7]] | | + | |
| - | | Nov 2 | Graphs, adjacency lists, matrices | 10.1, 10.3 | | | + | |
| - | | Nov 5 | Warshall's algorithm, Floyd's algorithm | | | | + | |
| - | | Nov 6 | | | [[Relational Database | Relational Database Part 2]] | | + | |
| - | | Nov 7 | Depth-first search, breadth first search | 10.4 | [[Homework 8]] | | + | |
| - | | Nov 9 | Strongly connected components | | | | + | |
| - | | Nov 12 | [[Optimizing Rule Evaluation]] | [[Optimizing Rule Evaluation]] | | | + | |
| - | | Nov 14 | Dijkstra's Algorithm | 10.6 | | | + | |
| - | | Nov 16 | Trees | 11.1, 11.2 | | | + | |
| - | | Nov 19 | Tree traversal | 11.3 | [[Homework 9]] | | + | |
| - | | Nov '''20''' | Spanning trees | 11. 4 | | | + | |
| - | | Nov 26 | Minimal spanning trees | 11.5 | [[Datalog Interpreter | Datalog Interpreter Part 1]] | | + | |
| - | | Nov 28 | Induction | 5.1, 5.2, 5.3 | [[Exams | Midterm 2]] (scheduled M-F) | | + | |
| - | | Nov 30 | Induction | 5.4, 5.5 | [[Homework 10]] and [[Datalog Interpreter | Datalog Interpreter Part 2]] | | + | |
| - | | Dec 3 | Induction | | | | + | |
| - | | Dec 4 | | | [[Optimizing Rule Evaluation | Optimizing Rule Evaluation Part 1]] | | + | |
| - | | Dec 5 | Induction | | [[Homework 11]] | | + | |
| - | | Dec 7 | Course Wrap-up | | | | + | |
| - | | Dec 10 | Final review | | | | + | |
| - | | Dec 11 | | | [[Optimizing Rule Evaluation | Optimizing Rule Evaluation Part 2]] | | + | |
| - | | Dec 12 | Final review | | | | + | |
