1.Consider a B+ tree in which the maximum number of keys in a node is 5.What is the minimum number of keys in any non-root node?

a)4 b)3 c)2 d)1.

2.Which of the following concurrency control protocols ensure both conflict serializibilty and freedom from deadlock?

1.2 phase locking.

2.Time stamp ordering.

(a)1 only (b)2 only ©Both 1 and 2 (d)Neither 1 nor 2.

3.The following functional dependencies hold for relations R(A,B,C) and S(B,D,E)

B —> A

A ---->C

The relation R contains 200 tuples and the relation S contain 100 tuples ,what is the maximum number of tuples possible in the natural join of R and S?

a)100 b) 200 c)300 d)2000