CSCI 470 Spring 2011
Languages and Machines
Archived Class
Charles Cusack
Computer Science
Hope College
Main
Schedule
Grading
Gradebook

Policies
Advice
College
    Policies

Notes
Programs
Tutorials

CSCI 385
MATH 160
Others

Admin
previous     next     today     future     all    

Schedule for weeks 1 through 16

Wk Day Date TopicResourcesEvents

1MonJan 10
  • None
  • No class yet

    WedJan 12
  • Introduction to the course
  • Discrete mathematics review
  • Course website

  • 2MonJan 17
  • Languages
  • Proofs!
  • Chapter 0
  • Languages Notes
  • Proofs Notes
  • Proof Examples
  • Induction Proofs
  • P-NP-NP-Complete
  • Computational Complexity (Just for picture)
  • Compexity Classes
  • HW 0 due

    WedJan 19More proofs and other review stuff HW 1 due

    3MonJan 24Finite Automata
  • Chapter 1.1
  • Finite State Machines Notes
  • JFlap
  • JFlap Tutorial

  • WedJan 26DFAs HW 2 due

    4MonJan 31NFAsChapter 1.2

    WedFeb 02SnowSnowSnow Day!

    5MonFeb 07Regular Expressions
  • Chapter 1.3
  • xkcd: Regular Expressions
  • HW 3 due

    WedFeb 09Nonregular LanguagesChapter 1.4 HW 4 due (Friday)

    6MonFeb 14Winter BreakNo Class

    WedFeb 16Chapters 0-1 (Catch up and review) HW 5 due (Friday)

    7MonFeb 21Context-Free Grammar
  • Chapter 2.1
  • Grammar Notes
  • C++ Grammar
  • Java Grammar
  • A simple grammar

  • WedFeb 23Chapters 0-1Exam 1

    8MonFeb 28
  • Pushdown Automata
  • Non-Context-Free Languages
  • Chapter 2.2 HW 6 due

    WedMar 02Non-Context-Free LanguagesChapter 2.3 HW 7 due

    9MonMar 07
  • Pushdown Automata
  • Non-Context-Free Languages
  • HW 8 due

    WedMar 09Turing Machines
  • Chapter 3.1
  • Turing Machine stuff (See picture near middle)
  • Turing Machine Cartoon
  • Turing Machine Applet
  • TM Program
  • xkcd: Candy Button Paper
  • xkcd: A Bunch of Rocks
  • LEGO Turing machine

  • 10MonMar 14
  • Turing Machine Variants
  • Algorithms
  • Chapter 3.2-3.3

    WedMar 16
  • Turing Machines
  • Church-Turing Thesis
  • The Interactive Nature of Computing: Refuting the Strong Church-Turing Thesis
  • HW 9 due

    Spring Break Week

    11MonMar 28Decidable Languages
  • Chapter 4.1
  • Decidability Notes

  • WedMar 30Chapters 0-3
  • Pencil
  • Paper
  • Definition/Results sheet
  • Exam #2

    12MonApr 04The Halting Problem
  • Chapter 4.2
  • Halting Problem Notes

  • WedApr 06Reducibility
  • Chapter 5.1
  • Reducibility Notes

  • 13MonApr 11Reducibility
  • Chapter 5.2-5.3
  • Reducibility Notes
  • HW 10 due

    WedApr 13Reducibility

    14MonApr 18Complexity
  • Chapter 7.1-7.2
  • Complexity Notes
  • HW 11 due

    WedApr 20
  • NP
  • NP-Complete
  • Chapter 7.3-7.4
  • NP-Complete Notes
  • HW 12 due

    15MonApr 25NP-Complete
  • Chapter 7.4-7.5
  • Reduction Examples
  • Complexity Notes

  • WedApr 27
  • Final Exam Review
  • Semester Wrap-up
  • HW 13 due (Friday--no lates!)

    ExWedMay 04The whole book
  • Pen or Pencil
  • Paper
  • Definition/Results Sheet
  • Brain
  • Exam #3 @ 12:30pm