S 2001 Midterm Sample - Solutions
Problem 1.
YES: b, d, e
NO: a, c,
Problem 2.
YES: c, d
NO: a, b
Problem 3.
TRUE: e
FALSE: a, b, c, d
Problem 4.
The language defined by a context free grammar G is the set of all strings of
terminal
symbols derivable from
Assignment 1: Solutions
Problem 1:
The string (e0e1e1)^R(01)^2(01)^0)^R can be simplified to
(011)^R(01)^2)^R
and further to
(011)^R(01)(01)
(a) the string is: 1101010 and its length is 7;
(b) the string is: 1010101 and its elements, in order, are: 1, 01,
EECS 2001 Midterm Examination
Version B
Solutions
Version B starts with Problem 1 concerning grammars:
"Which of the following statements are true and which are false:"
Problem 1.
TRUE: a, b
FALSE: c, d, e
Problem 2.
TRUE: b, c, e
FALSE: a, d
Problem 3.
N
CSE 2001:
Introduction to Theory of Computation
Summer 2013
Yves Lesperance
[email protected]
Office: LAS 3052A
Course page: http:/www.cse.yorku.ca/course/2001
Slides are mostly taken from Suprakash Dattas for Winter 2013
13-05-09
CSE 2001, Summer 201
CSE 2001 3.0 Intro to Theory of Computation
Summer 2013
Dept. of Computer Science & Engineering
York University
Assignment 2 Solutions
Total marks: 90.
Out: June 24
Due: July 8 by 18:45 in the dropbox, or 19:00 in class
Note that:
The assignment can be h
CSE 2001:
Introduction to Theory of Computation
Summer 2013
Week 9: Turing Machines and the
Church-Turing Thesis
Yves Lesprance
Course page: http:/www.cse.yorku.ca/course/2001
Slides are mostly taken from Suprakash Dattas for Winter 2013
13-07-27
CSE 2001
CSE 2001:
Introduction to Theory of Computation
Summer 2013
Week 10: Decidability Part 2
Yves Lesprance
Course page: http:/www.cse.yorku.ca/course/2001
Slides are mostly taken from Suprakash Dattas for Winter 2013; some
slides are adapted from Wim van Dam
CSE 2001:
Introduction to Theory of Computation
Summer 2013
Yves Lesperance
[email protected]
Office: CSEB 3052A
Phone: 416-736-2100 ext 70146
Course page: http:/www.cse.yorku.ca/course/2001
Slides are mostly taken from Suprakash Dattas for Winter 201
CSE 2001:
Introduction to Theory of Computation
Summer 2013
Yves Lesperance
[email protected]
Office: CSEB 3052A
Phone: 416-736-2100 ext 70146
Course page: http:/www.cse.yorku.ca/course/2001
Slides are mostly taken from Suprakash Dattas for Winter 201
CSE 2001:
Introduction to Theory of Computation
Summer2013
Week 6: Context-Free Languages
Yves Lesperance
Course page: http:/www.cse.yorku.ca/course/2001
Slides are mostly taken from Suprakash Dattas for Winter 2013
13-06-11
CSE 2001, Summer 2013
1
Next
C
CSE 2001 3.0 Intro to Theory of Computation
Summer 2013
Dept. of Computer Science & Engineering
York University
Assignment 3 Solutions
Total marks: 60.
Out: July 15
Due: July 25 by 18:00 in the dropbox.
Note that:
The assignment can be handwritten or typ
CSE 2001:
Introduction to Theory of Computation
Summer 2013
Week 11: Reducibility
Yves Lesprance
Course page: http:/www.cse.yorku.ca/course/2001
Slides are mostly taken from Suprakash Dattas for Winter 2013; some
slides are adapted from Wim van Dams slide
CSE 2001:
Introduction to Theory of Computation
Summer 2013
Week 8: Non-CFLs and CFL Pumping
Lemma
Yves Lesprance
Course page: http:/www.cse.yorku.ca/course/2001
Slides are mostly taken from Suprakash Dattas for Winter 2013
13-07-08
CSE 2001, Summer 2013
CSE 2001:
Introduction to Theory of Computation
Summer 2013
Week 5: The Pumping Lemma and NonRegular Languages
Yves Lesperance
Course page: http:/www.cse.yorku.ca/course/2001
Slides are mostly taken from Suprakash Dattas for Winter 2013
13-06-04
CSE 2001,
EECS 2001 Midterm Sample
Before you start solving problems, enter:
your full name:
your student number:
This Midterm Test is worth 30%, distributed as shown.
1
Problem 1. (2.5%)
Which of the following sets can be considered alphabets:
(a) the set cfw_0,
EECS2001
ASSIGNMENT 2
- SOLUTIONS
PROBLEM 1 (1%)
there could be several similar solutions but all of them should resemble this
one:
The SIMPLE grammar is expanded into
G'=<V',T',P',<program>, where:
V'=V union cfw_<for>
T'=T union cfw_for, to, step, next
EECS 2001 Midterm Examination
Version A
Solutions
Version A starts with Problem 1 concerning alphabets and strings:
Let T=cfw_0, ., 9, begin, end, if, read, x, +, -, ), ( be an
alphabet
Pproblem 1.
(a) 3
(b) 3
(c) )x(
(d) yes
(e) no
Pproblem 2.
true: a, d
EECS 2001: Sample Final Exam
* Solve multiple choice problems by marking appropriate TRUE, FALSE, YES, or NO.
* If you don't know how to answer a particular question, it is
recommended that you leave such a question unanswered.
Problem 1.
TRUE: b, d
FALSE
EECS2001
ASSIGNMENT 1
DEADLINE: Oct. 13th, 2015
NOTES:
Assignments must be deposited in the EECS 2001 drop box before 6pm.
Assignments must have EECS 2001 cover page clearly indicating: your full
name, student number, the course name, and this assignmen
EECS2001
ASSIGNMENT 3
DEADLINE: December 3, 2015
NOTES:
Assignments must be deposited in the EECS 2001 drop box before 6pm.
Assignments must have EECS 2001 cover page clearly indicating: your full
name, student number, the course name, and this assignme