CSE541
EXERCISE 10 SOLUTIONS
Covers Chapters 10, 11, 12 Read and learn all examples and exercises in the chapters as well! QUESTION 1 Let GL be the Gentzen style proof system for classical logic dened in chapter 11. Prove, by constructing a proper decompo
a
a
a
a
a
a
a
a
a
a
a
a
a
(collide)
(reverse)
r
R
c
W
(rev)
(whiplash)
(ignition)
i
S
(start)
b (brakes)
P
(park)
b (brakes)
o
(off)
(forward)
f
G
(go)
(collide)
c
J
(jail)
E
E
T
int
T
*
E
T
int
+
int *
+
E
E
T
E
T
int
T
int
int
S
A
A
B +
y
+
+
A
B +
y
+
Partial Answers to Micro Prelim 2/2002
1. b. A pure strategy for player A is a move in each information set for A. Since there are two moves in each
of two information sets, there are 22 = 4 pure strategies for A. The same reasoning shows that there are
f
CS 164 Programming Languages and Compilers
1. First and Follow Sets
(15 points)
Consider the following three grammars
1. A —> BC First(A) :{ m}
B —> A11: 96 First(B) ={ m}
C —> y0 y Fir8t(0)={y}
2. A —> BC First(A) ={ w, y}
B —> Am no | 6 First(B) ={ m; y
May 17, 2005
CS211 Final Exam
Page 1 of 12
1. (5 points) Consider a sorted circular doubly-linked list where the head element
points to the smallest element in the list.
(a) What is the asymptoptic complexity of nding the smallest element in the
list? O(1
CS 70
Spring 2005
Discrete Mathematics for CS
Clancy/Wagner
Final Solns
Problem 1. (8 points)
Let a(n) denote the number of ternary strings of length n with no pair of adjacent 2s. Example: 2011 is a
ternary string with no pair of adjacent 2s.
(a) What ar
Math 215 Fall 2007 Exam 2 Solutions
Low: 55 Average: 88 High: 100
Approximate grade breakdown (if I curved this exam):
90 100
A
80 90
B
0 80
C or below
1. Suppose f ( x, y ) 7 x 2 5 xy y 2 x y 6 .
(a)
f
14 x 5 y 1 , which at ( x, y ) (2,1) is 14(2) 5(1)
5
1
4
2
3
k
a
R1
R5
b
R1
R4
g
f
R1
d
R2
R3
c
OV
n
nnn
nnn
nn
nnn
nnn
n
nnn
nnn
wn
o
gOOO
OOO
OOO
OOO
OOO
OOO
OOO
O
GF
@A
WWW+
oo7
ooo
ooo
ooo
@A
o
PPP
PPP
PPP
PPP
PPP
PPP
PPP
PP'
/
7 GH
ooo
ooo
oo
ooo
oo
ooo
ooo
ooo
o
BC