CS 4410, Spring 2022 Class
Schedule, Lecture Notes
Note: Schedule is subject to
change, please check frequently
|
WK |
Class/Date |
Topic |
Book Chapter |
Assignments
|
Reading |
| 1 |
F 1/28 |
Course Introduction | Syllabus | ||
|
2 |
M
1/31 |
Mathematical Preliminaries and Notation | 1.1 |
Assignment 1 |
Chapter 1 |
|
W 2/2 |
Research and Internship Opportunities Mathematical Preliminaries and Notation |
1.1 |
|||
|
F 2/4 |
Mathematical Preliminaries and Notation | 1.1 |
|||
|
3 |
M 2/7 |
Mathematical Preliminaries and Notation | 1.1 |
||
|
W 2/9 |
Three
Basic Concepts |
1.2 |
Assignment 1 Due Assignment 2 |
||
|
F 2/11 |
Three Basic Concepts | 1.2 |
|||
|
4 |
M 2/14 |
Three Basic Concepts | 1.2 |
||
|
W 2/16 |
Three Basic Concepts Deterministic Finite Accepters |
1.2 and
2.1 |
|||
|
F 2/18 |
Homework Session on Assignment 2 |
||||
5 |
M 2/21 |
Deterministic Finite Accepters | 2.1 |
Assignment 2 Due Assignment 3 |
|
| W 2/23 |
Nondeterministic Finite Accepters | 2.2 |
|||
| F
2/25 |
Equivalence of Deterministic and Nondeterministic Finite Accepters | 2.3 |
Assignment 4 | ||
6 |
M
2/28 |
Regular Expressions |
3.1 |
Assignment 3 Due |
|
| W 3/2 |
Regular Expressions and Regular Languages | 3.2 |
|||
| F
3/4 |
Regular Grammars |
3.3 |
Assignment 5 | ||
|
7 |
M 3/7 |
No Class Today, instead 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 |
|
|
W 3/9 |
More Regular Grammar and Hints for HW4 | ||||
|
F 3/11 |
Closure Properties of Regular Languages | 4.1 |
Assignment 4 Due |
||
|
8 |
M 3/14 |
Elementary Questions about Regular
Languages |
4.2 | Reaction Paper Due |
|
|
W 3/16 |
Identifying Nonregular Languages | 4.3 |
Assignment 6 | ||
|
F 3/18 |
Homework 5 Hints |
Ch 3 |
|||
|
9 |
M 3/21 |
Identifying Nonregular Languages | 4.3 |
Assignment 5 Due | |
|
W 3/23 |
Homework 6 Hints and
Group Work |
Ch 4 |
Assignment 7 |
||
|
F 3/25 |
Homework 6 and 7 Group Work | Ch 4 |
|||
| Spring Break, March
28 - April 1 |
|||||
|
10 |
M 4/4 |
Context-Free Grammars |
5.1 |
||
|
W 4/6 |
Context-Free Grammars |
5.1 |
Assignment 6 Due | ||
|
F 4/8 |
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 |
||
|
11 |
M 4/11 |
Context-Free Grammars |
5.1 |
||
|
W 4/13 |
Work on HW 7 |
4.3 |
|||
|
F 4/15 |
Work on HW 7 |
4.3 |
Assignment 7 Due | ||
|
|
|
Context-Free Grammars, Parsing and Ambiguity | 5.2 |
Buzzard
Reaction Paper Due in Canvas Assignment 8 |
|
|
W 4/20 |
Discussion of plans
for quizzes and final exam |
||||
|
F 4/22 |
Nondeterministic Pushdown Automata | 7.1 |
Assignment 9 |
||
|
13 |
|
Assignment 8 hints and NPDA |
7.1 |
||
|
W 4/27 |
Nondeterministic Pushdown Automata | 7.1 |
|||
|
F 4/29 |
Work on HW 8 |
Assignment 8 Due | |||
|
14 |
|
Pushdown Automata and CFLs | 7.2 | ||
|
W 5/4 |
Work on HW 9 |
||||
|
F 5/6 |
Overview
of chapters 7 and 8 |
Assignment 9 Due |
|||
|
15 |
|
Turing Machines | 9 |
Quizzes
Due |
|
|
W 5/11 |
Some problems that cannot be solve by Turing Machines | 12 |
Final Exam Posted |
||
|
F 5/13 |
Efficiency of Computation | 14 |
|||
|
16 |
|
Extra-Credit Reflections on your own |
see Canvas |
||
|
W 5/18 |
Reading Day |
||||
|
|
|||||
Friday 5/20 |
11:15 am - 1:15 pm |
Final exam and all work due to be uploaded to Canvas by 1:15 pm |