Chris Pollett > Old Classes >
CS154

( Print View )

Student Corner:
  [Grades Sec1]

  [Submit Sec1]

  [Class Sign Up Sec1]

  [
Lecture Notes]
  [Discussion Board]

Course Info:
  [Texts & Links]
  [Topics/Outcomes]
  [Outcomes Matrix]
  [Grading]
  [HW/Quiz Info]
  [Exam Info]
  [Regrades]
  [Honesty]
  [Additional Policies]
  [Announcements]

HW Assignments:
  [Hw1]  [Hw2]  [Hw3]
  [Hw4]  [Hw5]  [Quizzes]

Practice Exams:
  [Mid]  [Final]

                           












Learning Outcomes versus Collected Course Materials
LO1LO2LO3LO4LO5LO6LO7LO8LO9L10N/A
HW1X
HW2XXXX
HW3XXX
MTP1X
MTP2XX
MTP3X
MTP4X
MTP5XX
HW4X
HW5X
FEP1X
FEP2X
FEP3X
FEP4XX
FEP5X
FEP6X
FEP7XX
FEP8X
FEP9X
FEP10X

MTPn = Midterm Problem n. FEPn = Final Exam Problem n. Within the class there were two versions of a given test; however, these two versions were just problem permutations of each other. The results above are all for the first of these two permutations. The two classes each had different tests which were variants of each other, testing the same learning outcomes.

LO1 (Learning Outcome 1) -- Write a grammar for a language described otherwise.

LO2 -- Construct deterministic and non-deterministic machines for various languages.

LO3 -- Describe a language in terms of a regular expression.

LO4 -- Find a regular expression for a language described by a finite automaton and conversely.

LO5 -- Construct a deterministic finite automaton from a non-deterministic one.

LO6 -- Minimize a deterministic automaton.

LO7 -- Be able to use a pumping lemma to show that some languages are not regular and/or not context-free Use closure properties to simplify proofs of non-regularity of languages.

LO8 -- Be able to construct a pushdown automaton accepting a given language.

LO9 -- Construct a Turing machine accepting some simple languages.

LO10 -- State in precise mathematical terms what is meant by undecidability of the Halting Problem, and be able to show the undecidability of simple extensions of the Halting Problem, using the reduction technique.

N/A -- Important material covered in the course but not directly related to a specific learning outcome.