CS 4410, Fall 2019 Class
Schedule, Lecture Notes
Note: Schedule is subject to
change, please check frequently
|
WK |
Class/Date |
Topic |
Book Chapter |
Assignments
|
Reading |
1 |
|||||
|
F 8/23 |
Syllabus | 1 |
HW1 Assigned | Syllabus | |
|
2 |
M
8/26 |
Mathematical Preliminaries
and Notation |
1.1 |
PMI Proofs PSMI Proofs |
|
|
W 8/28 |
Mathematical Preliminaries and Notation | 1.1 |
Extra Credit: Take
survey by 8/31 https://tinyurl.com/CollegeOfScienceFall2019 |
||
|
F 8/30 |
Mathematical Preliminaries and Notation | 1.1 |
HW1 Due |
||
|
3 |
M 9/2 |
Labor Day Holiday - no class |
|||
|
W 9/4 |
Languages,
Grammars, and Automata |
1.2 |
HW2 Assigned |
||
|
F 9/6 |
Languages, Grammars, and Automata | 1.2 |
|||
|
4 |
M 9/9 |
Homework 2 and Automata |
1.2 |
HW2 Due |
|
|
W 9/11 |
Watch: Brian Christian and Tom Griffiths "Algorithms to Live By" Talks at Google |
Reaction
Paper: 1. List the problems they discussed.
2. Pick one of the problems and describe it and their
solution(s).3. Describe a problem in your life that might have an algorithmic solution. |
https://www.youtube.com/watch?v=OwKj-wgXteo |
||
|
F 9/13 |
Career Services Presentation: Jaskaran
Dhesi |
Reaction Paper:
What was the most useful part of the presentation and why. |
|||
5 |
M 9/16 |
Automata |
1.2, 2.1 |
Reaction Papers Due HW3 Assigned |
|
| W 9/18 |
Watch: What Computers Can't Do - with Kevin Buzzard |
|
Reaction Paper: What is P vs NP? Why is it important? |
https://www.youtube.com/watch?v=jQPb7DRMoZY | |
| F
9/20 |
Study Abroad - Brittany Fentress |
Reaction Paper: 1. Three questions to ask 2. What was the most useful part of the presentation and why. |
Students traveling to Tapia will write a
reaction paper: 1. What was most interesting at the conference and why 2. What was most valuable and why |
||
6 |
M
9/23 |
Automata |
2.1 |
Reaction Papers Due |
|
| W 9/25 |
Automata |
2.1 |
|||
| F
9/27 |
Automata - HW3 |
2.1 |
|||
|
7 |
M 9/30 |
NFAs |
2.2 |
HW3 Due |
|
|
W 10/2 |
NFA, DFA Equivalence,
Regular Expressions |
2.3,
3.1 |
HW4
Assigned |
||
|
F 10/4 |
NFA -> DFA, Regular Expressions | 2.3, 3.1 | |||
|
8 |
M 10/7 |
HW4 |
2.2, 2.3 |
||
|
W 10/9 |
Regular Expressions and Regular Languages | 3.2 |
HW4
Due |
||
|
F 10/11 |
Quiz 1 Regular Grammars |
2.1 3.3 |
HW5 Assigned |
||
|
9 |
M 10/14 |
Regular Grammars |
3.3 |
||
|
W 10/16 |
Closure Properties of
Regular Languages |
4.1 |
|||
|
F 10/18 |
Quiz 2 |
2.2, 2.3 |
|||
|
10 |
M 10/21 |
Elementary Questions about Regular
Languages |
4.2 |
HW5 Due HW6 Assigned |
|
|
W 10/23 |
Identifying
Nonregular Langauges |
4.3 |
|||
|
F 10/25 |
Quiz 3, HW 6 | ||||
|
11 |
M 10/28 |
Identifying Nonregular Langauges | 4.3 |
||
|
W 10/30 |
HW 6 | ||||
|
F 11/1 |
HW 6 |
||||
|
|
|
Identifying Nonregular Langauges | 4.3 |
HW7 Assigned |
|
|
W 11/6 |
Quiz 4 |
HW6 Due | |||
|
F 11/8 |
HW 7 |
||||
|
13 |
|
School Holiday: Veterans' Day | |||
|
W 11/13 |
Context-Free Grammars | 5.1 |
|||
|
F 11/15 |
Midterm (make up
Quiz 1-4) |
||||
|
14 |
|
CFGs and Parsing and Ambiguity | 5.1, 5.2 |
HW7 Due |
|
|
W 11/20 |
Parsing and Ambiguity | 5.2 |
HW8 Assigned |
||
|
F 11/22 |
Quiz 5 | ||||
|
15 |
|
Read Some problems that cannot be solve by Turing Machines | 12.1 |
Write
a summary of the section and two questions |
|
|
W 11/27 |
Efficiency of Computation | 14.1 |
Write a summary of the section and two questions | ||
|
F 11/29 |
School Holiday: Thanksgiving | ||||
|
16 |
|
Nondeterministic Pushdown Automata | 7.1 |
HW8 Due |
|
|
W 12/4 |
Nondeterministic Pushdown Automata | 7.1 |
Final Exam |
||
|
F 12/6 |
Nondeterministic Pushdown Automata | 7.1 |
12.1 and 14.1 Summaries Due |
NPDA Cheat
Sheet |
|
| 17 |
M 12/9 |
Turing Machines and Halting |
|||
| W 12/11 |
Reading Day | ||||
| |
Wednesday 12/18 |
FINAL EXAM |
Final Exam Due |