Course Schedule, CS A351

MS = Automata Textbook (Michael Sipser)
CLRS = Algorithms Textbook (Cormen, Leiserson, Rivest, Stein)

Date			Topic	Reading	Wk	Additional Reading Notes
M/W	Jan	11,13	Introduction and Motivation Mathematical Notation	MS: Chap 0	1	Intro: ppt, pdf Video: Lecture 1, Lecture 2
W	Jan	20	Mon, Jan 18: MLK Holiday Regular Languages: DFA	MS: Chap 1.1	2	DFAs: ppt, pdf Video: Lecture 3
M/W	Jan	25,27	NFA's Regular Expressions	MS: Chap 1.2-1.3	3	Regular Expressions: ppt, pdf Unix/Java RegEx: pdf Video: Lecture 4, Lecture 5
M/W	Feb	1,3	Pumping Lemma I Context-Free Grammars	MS: Chap 1.4, 2.1	4	Non-regular langs: pdf, ppt Context-Free Grammars: pdf, ppt Video: Lecture 6, Lecture 7
M/W	Feb	8,10	Pushdown Automata Pumping Lemma II	MS: Chap 2.2-2.3	5	Pushdown automata: pdf, ppt Pumping Lemma II: pdf, ppt Video: Lecture 8
M/W	Feb	15,17	Turing Machines	MS: Chap 3	6	Turing Machines, Decidability: pdf, ppt
M/W	Feb	22,24	Decidability Reducibility	MS: Chap 4-5	7	P/NP: ppt, pdf
M/W	Mar	1,3	Time Complexity, P/NP Midterm, Wednesday, Mar. 3	MS: Chap 7, CLRS: Chap 34	8	.
M/W	Mar	8,10	Spring Break	.	9	.
M/W	Mar	15,17	Complexity, Algorithm Basics, Notation	CLRS: Chap 1-3	10	.
M/W	Mar	22,24	Recurrence Relations	CLRS: Chap 4	11	.
M/W	Mar/Apr	29,31	Selection, Sorting	CLRS: Chap 6-9	12	.
M/W	Apr	5,7	Graphs, Shortest Path	CLRS: Chap 22-24,26	13	.
M/W	Apr	12,14	Dynamic Programming	CLRS: Chap 15, 25	14	.
M/W	Apr	19,21	String Matching, Other Topics?	CLRS: Chap 32	15	.
M	Apr	26	Final Exam Week (normal classes scheduled on Monday)	.	Finals Week	Final Exam Friday 4/30 10:00-12:45