cs133

Semester 1, AY 2018--2019.
 by Francis George C. Cabarle


The introduction of suitable abstractions is our only mental aid to reduce the appeal to enumeration, to organize and master complexity. — E. W. Dijkstra

  • Welcome to the class web page for CS 133 WFW-1! Files and announcements will be concatenated to this list, from oldest (top) to newest (bottom). Stay tuned!
  • 14 ago: syllabus now uploaded! Also, for each exam there is at least 1 required reading or RR. Please make sure you read these RR since they are included in the exams.
  • 23 ago: As announced in class earlier this week, EXAM 1 is on 29 August 2018. Please be sure to work on the exam reviewer and read the RR.
  • 27 ago: Quiz 1 and 2 results can be obtained from me on Tuesday, 28 August 2018, at room 317 or 319 from 16:30h to 17:00h, otherwise I will release them after exam 1 on Wednesday.
  • 18 sep: New resources have been added: Links to creating and simulating DFA, CFG, PDA using the JFLAP simulator. 
 Weektopics Resources
1Introduction,
regular languages and finite automata, regular operations.
Day 1
RR1
Day 2
Day 3
DFA with JFLAP simulator
Nondeterministic finite automata,
equivalence of DFA and NFA,
Minimization of states. 
Day 4
Day 5
Regular expressions,
equivalence of regular expressions to finite automata.
 
Nonregular languages, Pumping lemma,
Review for exam 1,
EXAM1 (29 August 2018)
Day 6 
exam1 reviewer
 5 CFLs, CFGs,
CFG in CNF, closure properties
Day 9
Day 10
Day 11 , RR2
PDAs,
CFGs and PDAs
 Day 12
Day 13
CFG and PDA with JFLAP simulator
problem set for exam2
DPDA,
NonCF languages,
Review for exam2 
Day 14 
EXAM2 (28 September 2018)  
Turing machines, transducers,
Variants (e.g. multitape, nondeterministic),
Universal TM
RR3RR4
Day 17
Day 18
Day 19
Turing machines in JFLAP simulator
10  More on recursive (decidable) and 
recursively enumerable languages,
Noncomputable languages,
Chomsky hierarchy so far
Review for exam3
 Day 20 (RR5)
Day 21
Day 22
Day 23
reviewer
   
11Reducibility,
Time complexity and complexity classes
Day 23 (PCP example)
Day 24
RR6
Day 25
Day 26 (More on Cook-Levin Theorem
Some computationally hard games, 3SAT to CLIQUE)
reviewer
 EXAM3 ()  
 REMOVAL EXAM ()  

  • Syllabus HERE.
  • View the UP Diliman academic calendar here: https://upd.edu.ph/