CSCI 338: Computer Science Theory

Fall 2019

Date Lecture Topic Reading Homework
27 Aug
29 Aug
Introduction/Background
DFA
 
31-40
 
 
03 Sep
05 Sep
DFA
NFA
40-44
47-54
HW 1 (Due 10 Sep)
Solution
10 Sep
12 Sep
NFA Equivalance
Regular Operations
54-63
44-47, 58-63
HW 2 (Due 17 Sep)
Solution
17 Sep
19 Sep
Regular Expressions
Pumping Lemma
63-76
77-82
HW 3 (Due 24 Sep)
Solution
24 Sep
26 Sep
Pumping Lemma Handout
CFL/PDA
77-82
101-124
HW 4 (Due 01 Oct)
Solution
01 Oct
03 Oct
Review
Quiz 1 (Makeup)
 
 
 
 
08 Oct
10 Oct
Turing Machines
Decidability
165-172, 182-187
193-197
HW 5 (Due 15 Oct)
Solution
15 Oct
17 Oct
Decidability
Undecidability
197-200
201-210, 216-217
HW 6 (Due 22 Oct)
Solution
22 Oct
24 Oct
Undecidability
Undecidability
215-219
219-220
HW 7 (Due 29 Oct)
Solution
29 Oct
31 Oct
Review
Quiz 2
220-227
 
 
 
05 Nov
07 Nov
Time Complexity, P, NP
No Class - Watch Video
275-298
 
HW 8 (Due 12 Nov)
Solution
12 Nov
14 Nov
NP-Completeness
NP-Completeness
299-303
304-311
HW 9 (Due 19 Nov)
Solution
19 Nov
21 Nov
NP-Completeness Handout
Independent Set
311-322
Notes
HW 10 (Due 26 Nov)
Solution
26 Nov
28 Nov
Dominating Set / Approx Algs
Thanksgiving - No Class
Notes
 
HW 11 (Due 03 Dec)
Solution
03 Dec
05 Dec
Quiz 3
Review
 
 
 
 
11 Dec FINAL EXAM, 4:00 - 5:50 pm    
Schedule subject to change. Refresh webpage (or hit F5) to view current page.

Lecture

Instructor

Sean Yaw

Textbook

Course Prerequisites

Course Objectives

MSU course description: Formal languages, theory, automata, Turing Machines, computability, the Church-Turing thesis, computational complexity, and NP-completeness.

At the end of the course, my goal is for you to be able to:

  1. Understand what NP-Complete problems are, have an intuition for the solvability of new problems, and have familiarity with techniques to deal with NP-Complete problems.
  2. Given a problem, understand it and develop a clear, efficient plan to solve it.
  3. Be comfortable proving statements and formulating clear arguments.
  4. Understand that some problems cannot be solved.
  5. Understand various computational models and their inherit limitations.

Grading

At the end of the semester, grades will be determined (after any curving takes place) based on your class average as follows:

Late Policy

If you submit a homework assignment late, but within 12 hours of being due, the maximum credit you can receive is 50%. After 12 hours, you receive 0.

Collaboration Policy

Failure to abide by these rules will result in everyone involved being reported to the Dean of Students and could result in failing the course.