CS 4410, Fall 2018 Class
Schedule, Lecture Notes
Note: Schedule is subject to
change, please check frequently
|
WK |
Class/Date |
Topic |
Book Chapter |
Assignments
|
Reading |
1 |
W 8/22 |
Syllabus |
1 |
HW 1 Assigned | Syllabus |
|
F 8/24 |
Group work on HW 1 |
1.1 |
PMI Proofs PSMI Proofs |
||
|
2 |
M
8/27 |
Group work on HW 1 | 1.1 |
||
|
W 8/29 |
Languages |
1.2 |
HW 1 Due |
||
|
F 8/31 |
Grammars |
1.2 |
HW 2 Assigned |
||
|
3 |
M 9/3 |
Labor Day Holiday | |||
|
W 9/5 |
Grammars |
1.2 |
|||
|
F 9/7 |
Automata and HW 2 | 1.2 |
|||
|
4 |
M 9/10 |
Finite Automata | 2.1 |
HW 2 Due | |
|
W 9/12 |
Finite Automata | 2.1 |
|||
|
F 9/14 |
Finite Automata Work on HW 3 in groups | 2.1 |
HW 3 Assigned |
||
5 |
M 9/17 |
NFAs |
2.2 |
||
| W 9/19 |
NFA -> DFA |
2.3 |
HW 3 Due HW4 Assigned |
||
| F
9/21 |
Work on HW 4 in Groups |
2.2, 2.3 |
|||
6 |
M
9/24 |
Regular Expressions |
3.1 |
HW 5 Assigned |
|
| W 9/26 |
Work on HW 4 in Groups | HW 4 Due |
|||
| F
9/28 |
Regular Expressions and Regular Languages | 3.2 |
|||
|
7 |
M 10/1 |
Group work on HW 5 |
|||
|
W 10/3 |
Regular Grammars |
3.3 |
|||
|
F 10/5 |
Regular Grammars |
3.3 |
HW 5 Due |
||
|
8 |
M 10/8 |
Closure Properties of Regular Languages |
4.1 |
||
|
W 10/10 |
Non-Instructional
Day: No Class |
||||
|
F 10/12 |
Google Talk in Art 40 | Write one question for the speaker and a
reaction paragraph (what was interesting, what you
learned, what surprised you, etc.) |
|||
|
9 |
M 10/15 |
Closure Properties of Regular Languages |
4.1 |
Google
question/reaction Due |
|
|
W 10/17 |
Tech Fair |
Write a reaction paragraph: what
was the most interesting thing you saw at the Tech Fair and
Why? |
Tech Fair |
||
|
F 10/19 |
Take home midterm |
Emailed to students 10/18/18 |
|||
|
10 |
M 10/22 |
Go over HW |
1, 2 |
Tech
Fair Reaction Due |
|
|
W 10/24 |
Go over HW |
1, 2 |
|||
|
F 10/26 |
Go over HW |
2, 3 |
|||
|
11 |
M 10/29 |
Three Theorems | 4.2 |
Midterm Due |
|
|
W 10/31 |
Identifying
Nonregular Languages |
4.3 |
HW 6
Assigned |
||
|
F 11/2 |
Group work on HW 6 | ||||
|
|
|
Group work on HW 6 | 4.3 |
||
|
W 11/7 |
Identifying Nonregular Languages | 4.3 |
HW 6 Due HW 7 Assigned |
||
|
F 11/9 |
Identifying Nonregular Languages | ||||
|
13 |
|
School Holiday: Veterans' Day | |||
|
W 11/14 |
Campus Closed |
||||
|
F 11/16 |
Campus Closed | ||||
|
14 |
|
Campus Closed | |||
|
W 11/21 |
Campus Closed | ||||
|
F 11/23 |
School Holiday: Thanksgiving | ||||
|
15 |
|
Group work on HW 7 |
Final Exam |
||
|
W 11/28 |
Context-Free Grammars | 5 |
Chapter 5 Slides |
||
|
F 11/30 |
Nondeterministic Pushdown Automata | 7 |
HW 7 Due | Chapter 7 Slides | |
|
16 |
|
Turing Machines | 9.1 |
Chapter 9 Slides | |
|
W 12/5 |
Some problems that cannot be solve by Turing Machines | 12.1 |
Chapter 12 Slides Chapter 11 and 12 Slides from Class |
||
|
F 12/7 |
Efficiency of Computation | 14.1 |
Chapter 14 Slides | ||
| 17 |
M 12/10 |
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 |
|
| T 12/11 |
Reading Day | ||||
| |
Wednesday 12/12 |
FINAL EXAM |
Final Exam and Reaction Paper are due in CS Lab by 1:15 pm
on Wednesday, December 12th |