Schedule for CSC 250 Spring 2026
- Read the whole Syllabus (in Moodle)
## ALL Checked Up to Here —
Week 01: Intro
| Date | Topic | Due | Issued | Notes |
|---|---|---|---|---|
| 01/26 | SNOW DAY | |||
| 01/28 | L1: Class Intro | |||
| 01/30 | L2: Logic and proofs | HW01 Due Midnight of L4 (Logic and Proofs) QUIZ-00 |
Week 02: Regular Expressions
| Date | Topic | Due | Issued | Notes |
|---|---|---|---|---|
| 02/02 | L3: Intro Regular Expressions | |||
| 02/04 | L4: More Regular Expressions | |||
| 02/06 | L5: Practice/Catch-up | Homework 01 | HW02 Due before L7 (Regular Expressions) QUIZ-01 Proofs |
Week 03: Finite Automata
| Date | Topic | Due | Issued | Notes |
|---|---|---|---|---|
| 02/09 | L6: Intro Finite Automata | |||
| 02/11 | L7: Non-deterministic Automata and FA Properties | |||
| 02/13 | L8:Practice/Catch-up | Homework 02 | HW03 Due before L10 ( REs and Finite Automatons) QUIZ-02-REs |
Week 04: Regular and Non-Regular Languages and the Pumping Lemma
| Date | Topic | Due | Issued | Notes |
|---|---|---|---|---|
| 02/16 | L9: DFA-NFA equivalence AND RE-FA equivalence | |||
| 02/18 | L10: Regular and Non-Reg Langs and Pumping Lemma | |||
| 02/20 | L11: Practice/Catch-up | Homework 03 | HW04 Due before THURSDAY-DUE-DAY (Pumping Lemma, CFGs and PDAs) QUIZ-03-REs-FAs |
Week 05: Context-Free Grammars and Push-Down Automata
| Date | Topic | Due | Issued | Notes |
|---|---|---|---|---|
| 02/23 | SNOW DAY | |||
| 02/25 | L11: Context-Free Grammars | |||
| 02/27 | L11b:Context-Free Grammars |
Week 06: PDAs and Midterm Week
| Date | Topic | Due | Issued | Notes |
|---|---|---|---|---|
| 03/02 | L12: Push-Down Automata | |||
| 03/04 | L12b: Push-Down Automata | |||
| 03/05 | THURSDAY-DUE-DAY | DUE: Homework 04 | QUIZ-04: PL, CFGs, PDAs | |
| 03/06 | L13: Practice/Catch-up Midterm | |||
| 03/07 | Midterm | |||
| 03/08 | Midterm |
Week 07: Turing Machines
| Date | Topic | Due | Issued | Notes |
|---|---|---|---|---|
| 03/09 | L14: Turing Machines | |||
| 03/11 | L15: Decidability | |||
| 03/13 | L16: Practice/Catch-up | HW05 Due before L19 (Turing Machines and Decidability) |
Week 08: Spring Recess
| Date | Topic | Due | Issued | Notes |
|---|---|---|---|---|
| 03/16 | NO CLASSES: Spring Recess | |||
| 03/18 | NO CLASSES: Spring Recess | |||
| 03/20 | NO CLASSES: Spring Recess |
Week 09: Uncecidability and Reductions
| Date | Topic | Due | Issued | Notes |
|---|---|---|---|---|
| 03/23 | L17: Undecidability and Intro to Reductions | |||
| 03/25 | L18: More on Reductions | |||
| 03/27 | L19: Practice/Catch-up | Homework 05 | QUIZ-05-TMs |
Week 10: Enumeration and Mapping Reductions
| Date | Topic | Due | Issued | Notes |
|---|---|---|---|---|
| 03/30 | L20: Enumeration | |||
| 04/01 | L21: Mapping Reducibitlity | |||
| 04/03 | L22: Practice/Catch-up | Homework 06 | HW06 Due before L25 |
Week 11: Rice’s Theorem and Computability Summary
| Date | Topic | Due | Issued | Notes |
|---|---|---|---|---|
| 04/06 | L23: Rice theorem | |||
| 04/08 | L24: Summary: Computability | |||
| 04/10 | L25: Practice/Catch-up | Homework 06 | HW07 Due before L28 |
Week 12: Complexity Intro
| Date | Topic | Due | Issued | Notes |
|---|---|---|---|---|
| 04/13 | L26: Intro to Complexity and P Vs NP | |||
| 04/15 | L27: More Complexity and P Vs NP | |||
| 04/17 | L28: Practice/Catch-up | Homework 07 | Homework 08 |
Week 13: P Vs NP vs NP-Complete and Poly-Time Reductions
| Date | Topic | Due | Issued | Notes |
|---|---|---|---|---|
| 04/20 | L29: P Vs NP and NP-Completeness | |||
| 04/22 | L30: Poly-Time Reductions | |||
| 04/24 | L31: Bonus Lecture: LTL |
Week 14: More Poly-Time Reductions and Complexity Summary
| Date | Topic | Due | Issued | Notes |
|---|---|---|---|---|
| 04/27 | L32: More Poly-Time Reductions | |||
| 04/29 | L33: More Poly-Time Reductions | |||
| 05/01 | L34: Complexity Summary |