Schedule for CSC 250 Fall 2025
- Read the whole Syllabus (in Moodle)
Week 00: Welcome
| Date | Topic | Due | Issued | Notes |
|---|---|---|---|---|
| 09/05 | L0A: Class Intro |
Week 01: Intro
| Date | Topic | Due | Issued | Notes |
|---|---|---|---|---|
| 09/08 | L1A: Logic and proofs | |||
| 09/10 | L1B: Practice Logic and Proofs | |||
| 09/12 | L1C: MORE Practice Logic and Proofs | HW01 Due Midnight of L4 (Logic and Proofs) QUIZ-00 |
Week 02: Regular Expressions
| Date | Topic | Due | Issued | Notes |
|---|---|---|---|---|
| 09/15 | L2: Intro Regular Expressions | |||
| 09/17 | L3: More Regular Expressions | |||
| 09/19 | L4: Practice/Catch-up | Homework 01 | HW02 Due before L7 (Regular Expressions) QUIZ-01 Proofs |
Week 03: Finite Automata
| Date | Topic | Due | Issued | Notes |
|---|---|---|---|---|
| 09/22 | L5: Intro Finite Automata | |||
| 09/24 | L6: Non-deterministic Automata and FA Properties | |||
| 09/26 | L7: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 |
|---|---|---|---|---|
| 09/29 | L8: DFA-NFA equivalence AND RE-FA equivalence | |||
| 10/01 | L9: Regular and Non-Reg Langs and Pumping Lemma | |||
| 10/03 | L10: Practice/Catch-up | Homework 03 | HW04 Due before L_LTL (Pumping Lemma, CFGs and PDAs) QUIZ-03-FAs |
Week 05: Context-Free Grammars and Push-Down Automata
| Date | Topic | Due | Issued | Notes |
|---|---|---|---|---|
| 10/06 | L11: Context-Free Grammars | |||
| 10/08 | L12: Push-Down Automata | |||
| 10/10 | L13: Practice/Catch-up |
Week 06: Practice and Linear Temporal Logic Practice
| Date | Topic | Due | Issued | Notes |
| 10/13 | NO CLASSES: Columbus Day | |||
| 10/15 | L_Practice: Practice | |||
| 10/17 | L_LTL: Linear-Temporal-Logic | Homework 04 | QUIZ-04-RLs-PLs-CFGs-PDAs |
Week 07: Midterm Work Week
| Date | Topic | Due | Issued | Notes |
|---|---|---|---|---|
| 10/20 | L_Midterm_1: Midterm Review/Start | Midterm Released (after class) | (Up to CFGs and PDAs) | |
| 10/22 | L_Midterm_2: Midterm-Time | Midterm | Due on Moodle Before 11:59 PM | |
| 10/24 | L_Midterm_3: Catch-up + Midterm Review |
Week 08: Turing Machines
| Date | Topic | Due | Issued | Notes |
|---|---|---|---|---|
| 10/27 | L14: Turing Machines | |||
| 10/29 | L15: Decidability | |||
| 10/31 | L16: Practice/Catch-up | HW05 Due before L19 (Turing Machines and Decidability) |
Week 09: Uncecidability and Reductions
| Date | Topic | Due | Issued | Notes |
|---|---|---|---|---|
| 11/03 | L17: Undecidability and Intro to Reductions | |||
| 11/05 | L18: More on Reductions | |||
| 11/07 | L19: Practice/Catch-up | Homework 05 | HW06 Due before L22 (Undecidability and Reductions) QUIZ-05-TMs |
Week 10: Enumeration and Mapping Reductions
| Date | Topic | Due | Issued | Notes |
|---|---|---|---|---|
| 11/10 | L20: Enumeration | |||
| 11/12 | L21: Mapping Reducibitlity | |||
| 11/14 | L22: Practice/Catch-up | Homework 06 | HW07 Due before L25 (Ennumeration and Mapping Reductions) QUIZ-06-Undecidability and Reductions |
Week 11: Rice’s Theorem and Computability Summary
| Date | Topic | Due | Issued | Notes |
|---|---|---|---|---|
| 11/17 | L23: Rice theorem | |||
| 11/19 | L24: Summary: Computability | |||
| 11/21 | L25: Practice/Catch-up | Homework 07 | HW06 Due before L28 (Computability) QUIZ-07-Ennumeration and Mapping |
Week 12: THANKSGIVING WEEK
| Date | Topic | Due | Issued | Notes |
|---|---|---|---|---|
| 11/24 | L_Review_All: Computability Review | |||
| 11/26 | NO CLASSES: THANKSGIVING RECESS | |||
| 11/28 | NO CLASSES: THANKSGIVING RECESS |
Week 13: Complexity Intro
| Date | Topic | Due | Issued | Notes |
|---|---|---|---|---|
| 12/01 | L26: Intro to Complexity and P Vs NP | |||
| 12/03 | L27: More Complexity and P Vs NP | |||
| 12/05 | L28: Practice/Catch-up | Homework 08 | QUIZ-08-Computability |
Week 14: P Vs NP vs NP-Complete and Poly-Time Reductions
| Date | Topic | Due | Issued | Notes |
|---|---|---|---|---|
| 12/08 | L29: P Vs NP and NP-Completeness | |||
| 12/10 | L30: Poly-Time Reductions |