Foundations of Computer Science
Spring 2002
Department of Computer Science
| |
Foundations of Computer Science Spring 2002 Department of Computer Science | |
| | | (Read before class) | Jan 14
| Introduction to CS301.
| Preface
|
| Jan 15
| Review of set theory, relations.
| 1.1--1.3
| (Get started on Assignment 1 tonight. Bring questions to class!)
| Jan 16
| Review of functions, equivalence relations.
| 1.4--1.5
|
| Jan 17
| Review of countability, recursive definitions.
| 1.6
|
| Jan 22
| Induction
| 1.6
| Assignment 1:
Chapter 1 exercises 4, 9, 12, 14, 16, 18, 20, 27,
32. Due at start of class.
| Jan 23
| Review of directed graphs
| 1.7
|
| Jan 24
|
|
|
| Jan 28
| Strings and languages.
| 2.1, 2.2
| Assignment 2:
Chapter 1 exercises 34, 36, 39, 43. Due at start of class.
| Jan 29
| Regular sets and expressions.
| 2.3
|
| Jan 30
| Regular expressions and Unix.
| Information in our On-Line Resources on regular expressions
|
| Jan 31
| Regular expressions.
|
| Assignment 1 Re-do due.
| Feb 4
| Deterministic Finite Automata (DFA)
| 6.1-6.3
| Assignment 3 due: Chapter 2 exercises 2, 4, 9, 11, 15, 17, 21, 26, 34, 38a, 38c.
| Feb 5
| Nondeterministic Finite Automata
| 6.4
|
| Feb 6
| Lamda Transitions
| 6.5
|
| Feb 7
| Removing Nondeterminism
| 6.6
|
| Feb 11
| Minimization of DFA
| 6.7
|
| Feb 12
| FA questions
|
| Assignment 2, Re-do due.
| Feb 13
| FA and Regular Sets
| 7.1-7.2
|
| Feb 14
|
|
| Assignment 4 due. Chapter 6 exercises 3, 7, 11, 16c, 18, 23, 30, 34b, 40.
| Feb 17
| FA and Regular Grammars
| 7.3, and introduction to Chapter 3.
|
| Feb 18
| Nonregular Language
| 7.4-7.5
|
| Feb 19
| Pumping Lemma for Regular Languages
| 7.6
|
| Feb 20
| Pumping Lemma
| 7.7
|
| Feb 21
| More Regular Language Review
|
| Assignment 3, Re-do due.
| Feb 25
| Context-Free Languages, Regular Grammars
| 3.1, 3.2, 3.3
|
| Feb 26
| Context-Free Languages
|
|
| Feb 27
| Context-Free Languages
|
| Assignment 5 due. Chapter 7 exercises 2a,b,c, 4, 5, 10a,b, 11a,b. One Time Only
| Feb 28
| Context-Free Languages and Programming Language Grammars
| 3.4-3.6
|
| Mar 4
| Context-Free Languages
|
| Assignment 6 due. Chapter 3 exercises 2abcd, 4abc, 6abc, 10, 12, 14cd, 47. One time only.
| Mar 5
| Review
|
|
| Mar 6
| Midterm Exam
|
|
| Mar 7
| Midterm exam discussion
|
|
| Mar 11--15
| Spring Break
|
|
| Mar 18
| Parsing. Left-most derivation.
| 4.1-4.2
|
| Mar 19
| Breadth-first top-down parsing
| 4.3
|
| Mar 20
| Depth-first top-down parsing
| 4.4
|
| Mar 21
| Bottom-up parsing
| 4.5-4.6
|
| Mar 25
| Chomsky Normal Form of Grammars
| 5.1-5.4
| Assignment 7 due. Chapter 4 exercises 3, 4, 5, 7, 11, 14, 17, 18, 21, 22, 26, 28
| Mar 26
| Greibach Normal Form
| 5.5-5.6
|
| Mar 27
| Grammar Transformations
|
|
| Mar 28
| Pushdown Automata
| 8.1-8.2
|
| Apr 1
| Pushdown Automata and Context Free Languages
| 8.3
| Assignment 8 due. Chapter 5 exercises 23, 25, 30
| Apr 2
| Pushdown Automata and Context Free Languages
|
|
| Apr 3
| Pumping Lemma for CFL
| 8.4
|
| Apr 4
| Closure for CFL and Two-Stack PDAs
| 8.5--8.6
|
| Apr 8
| LL(k) Grammars
| 16.1--16.3
| Assignment 9 due. Chapter 8 exercises 3c, 3h, 3k, 12, 14, 17b
| Apr 9
| LL(k) Grammars
| 16.4--16.6
|
| Apr 10
| Quiz over Chapters 3, 4, and 5 (not 8)
| 16.7--16.8
|
| Apr 11
| Class Cancelled
|
|
| Apr 15
| LR(k) Grammars
| 17.1--17.3
|
| Apr 16
| LR(k) Grammars
| 17.4--17.5
|
| Apr 17
| LR(k) Grammars
|
|
| Apr 18
| LR(k) Grammars
|
|
| Apr 22
| LR(k) Grammars
|
|
| Apr 23
| Turing Machines
| 9.1--9.3
|
| Apr 24
| Alternative Turing Machine Formulations
| 9.4--9.6
| Assignment 11 due. Chapter 16 exercises 4a, 10c, 10d; Chapter 17 exercises 1a, 2
| Apr 25
| Nondeterministic Turing Machines, Language emulators
| 9.7--9.8
|
| Apr 29
| The Chomsky Hierarchy
| 10.1--10.4
|
| Apr 30
| Decidability and the Halting Problem
| 11.1--11.3
|
| May 1
| Tractability and NP-Complete Problems
| 15.1--15.6
| Assignment 9 Redo. Not required if your score is greater than 35.
| May 2
| Review
|
| Assignment 10, a
programming assignment. Electronically check in by 5:00 PM.
Assignment 12: Chapter 9 exercises 2, 3d, 5c (16 is optional, for extra credit). Assignment 11 redo due today, also.
| May 10
| 9:10 - 11:10 AM, Final Exam
|
| Hand in your CS301 notes to earn extra credit. Also hand in a
three page or longer report on the NPR radio interview of Rodney
Brooks.
| |