CS 271 Lectures - Fall 2008
Last modified August 18, 2008
|
Week |
Date |
Topic
|
Reading
|
Assignments |
|
1 |
8/26 |
Propositional Logic |
Rosen: 1.1 |
|
|
|
Logic Equivalences; Predicates and Quantifiers; Scoping and Nested Quantifiers |
Rosen 1.2-1.4 |
|
|
|
2 |
9/02 |
Review; Transposing and Negating Quantifiers; Rules of Inference |
Rosen 1.5 |
|
|
|
Proofs |
Rosen 1.6-1.7 |
|
|
|
3 |
9/09 |
Forward and Backward Chaining; Prolog |
||
|
|
Prolog Assignment |
|
||
|
4 |
9/16 |
Sets; |
Rosen 2.1-2.2 |
|
|
|
Functions; |
Rosen 2.3; |
|
|
|
5 |
9/23 |
Relations and Databases |
Rosen 8.2 |
|
|
|
Sequences and Summations; |
Rosen 2.4 |
|
|
|
6 |
9/30 |
Induction |
Rosen 4.1 |
|
|
|
Test Preparation |
|
Prolog Assignment is Due. Sunday, 2/24 |
|
|
7 |
10/07 |
Test 1 (Through Sequences and Summations) |
|
|
|
|
Recursion |
Rosen 4.3-4.4 |
|
|
|
8 |
10/14 |
Test 1 Postmortem |
|
|
|
|
Recursion |
|
|
|
|
9 |
10/21 |
Counting: Basics |
Rosen 5.1-5.2 |
|
|
|
Binominal Coefficients Pascal Triangle |
Rosen 5.4 |
|
|
|
10 |
10/28 |
Introduction to Graphs; Midterm 2 prep. |
Rosen 9.1-9.2 |
|
|
|
Midterm 2 (logic, sequences, summations, induction,
recursion, counting) |
|
|
|
|
11 |
11/4 |
Midterm postmortem; Graph representations |
Rosen 9.3 |
|
|
|
Isomorphism, Connectivity |
Rosen 9.3-9.4 |
||
|
12 |
11/11 |
A* Assignment |
|
A* Assignment |
|
|
Euler and Hamilton Paths; Shortest Path; |
Rosen 9.5-9.6 |
|
|
|
13 |
11/18 |
Planer Graphs, Graph Coloring |
Rosen 9.7-9.8 |
|
|
|
Trees: Applications, Traversal Spanning Trees, Minimum Spanning Trees |
Rosen 10.1-10.3 Rosen 10.4-10.5 |
||
|
14 |
11/25 |
Languages, Grammars; Finite State Machines |
Rosen 12.1-12.3 |
|
|
11/27 |
Thanksgiving Vacation |
|
|
|
|
15 |
12/2 |
Language Recognition |
Rosen 12.4 |
|
|
|
Turing Machines |
Rosen 12.5 |
|
|
Final is on Thursday 12/11 2-4pm |
||||
|
|
||||