Class Schedule

CSE 3315 - Theoretical Concepts
Tentative Lecture and Assignment Schedule
Fall Semester 2001 - TTh 7:00 - 8:20
Class	Date	Readings	Lecture Topics	Assignments
1	08/28		Course Details and Overview
2	08/30	1.1 - 1.4	Review: Sets, Relations, & Functions
3	09/04	1.5 - 1.6	Review: Closure & Proof Techniques
4	09/06	1.7 - 1.8	Languages
5	09/11	2.1	Deterministic Finite Automata
6	09/13	2.2	Nondeterministic Finite Automata
7	09/18	2.3 - 2.4	Regular Expressions
8	09/20	2.5	State Minimization	Homework 1 due
9	09/25	3.1 - 3.2	Context-free Grammars
10	09/27	3.3	Pushdown Automata	Homework 2 due
11	10/02	3.4	Pushdown Automata & Context-free Languages
12	10/04	3.5	Context-free Languages
13	10/09	4.1	Turing Machines	Homework 3 due
14	10/11		Exam 1 - Chapters 1 - 3
15	10/16	4.2	Turing Machines continued
16	10/18	4.3 - 4.5	Extensions of Turing Machines
17	10/23	4.6	Grammars
18	10/25	5.1	The Church - Turing Thesis
19	10/30	5.2	Universal Turing Machines	Homework 4 due
20	11/01	5.3	Undecidability
21	11/06	5.4 - 5.5	Undecidability continued
22	11/08		Computational Complexity
23	11/13	6.1 - 6.2	The Class ${\cal P}$
24	11/15	6.4	The Class ${\cal NP}$	Homework 5 due
25	11/20		Exam 2 - Chapters 4 & 5
	011/022	Thanksgiving - No Class
26	11/27	7.1	Complexity Classes & ${\cal NP}$-completeness
27	11/29	7.2	${\cal NP}$-complete Problems
28	12/04	7.3	${\cal NP}$-complete Problems continued
29	12/06		Conclusions and Review	Homework 6 due
30	12/13		Final Exam (8:15 pm - 10:45 pm) - Covers all Course Material

This schedule is tentative and subject to change. If changes are necessary they will be announced in class and posted in the schedule on the course page.