1. Construct a scenario leading to the worst-case performance of the FIFO buffer replacement policy.

2. Is it possible that deleting an entry reduces global depth by 3 in the Extendible Hashing?

3. Suppose that a page can contain at most 4 data values and all data values are integers. Using B+ trees of order 2, give examples of each of the following:

1) a B+ tree with number of levels changed from 1 to 2 when the value 60 is inserted. Show your structure before and after the insertion.

2) a B+ tree in which the deletion of the value 10 leads to a redistribution. Show your structure before and after the deletion.

4. For each of the following transactions, determine if it is conflict serializable or not? Show your working.

1) W1(X), R2(X), R1(Y), R3(X), W3(Y), R3(Y), R2(Y)

2) R1(X), W2(X), W2(Y), W3(Y), R1(Y)