EECS2001
**
EECS 2001:
Introduction to the Theory of Computation
**

Winter 2018

**Faithful Prof:**
Jeff Edmonds
jeff@cse.yorku.ca
Schedule

**Lectures:**

Lecture: 2:30-4:00 Mon LAS B, Wed CB 121

Tutorial: 2:30-4:00 Fri CB 121

** Midterms:** Mon Jan 29, Mon Feb 26, Mon Mar 19

** Exam:** Saturday, April 21 2:00 PM

Exam Location TM Tait

**Office Hours:** After class

**Important ** Dates

### Texts:

### Other References:

Harry R. Lewis and Christos H. Papadimitriou, *"Elements of the Theory of Computation",*,

J. E. Hopcroft and J. D. Ullman, *"Introduction to Automata Theory",*,
Addison-Wesley.

Ding-Zhu Du and Ker-I Ko. *Problem Solving in Automata, Languages, and
Complexity*. Wiley, 2001.

John C. Martin. *Introduction to Languages and the Theory of
Computation*. McGraw-Hill, 2003.

Daniel Solow. *How to Read and Do Proofs: An Introduction to
Mathematical Thought Processes*. Wiley, 2002.

A freely downloadable book on the foundations of Computer Science is
here.

A freely downloadable book on Discrete Math is here.

**GRADING:**

**5 Assignments:** 0%

**Pratice Assignments:** 0%

**3 Midterms (M**_{i}): Worth between 9%*3=27% and 18%*3=54%

**Class Participation (P):** Worth between 2% and 10%

**Exam:** Worth between 36% and 71%

** Final Mark**
= Σ_{i=1..3}
[
0.09 M_{i} + 0.09 Max(M_{i},E)
] + [
0.02 P + 0.08 Max(P,E)
] +
0.36 E

3101 Example

Your Marks