Question : 31

For the relation R(ABCDEF) with the following set of Functional Dependency
{ A^ E, AC^ D, B^ CFGH, D^ C, F^ G ,E^ FH}
Then {AB}+
(A) {ABCEGH}
(B) {ABCDEFGH}
(C) {ABDEFGH}

(D) {ABCEFGH}
Correct Option: B Explanation:
{AB}+={ABCDEFGH}
Using trivial and non trivial functional dependencies,
A^ E, AC^
D, B^
CFGH,
Question : 32

What is true about the UNION ALL operator ?

(A) It returns rows for the combined queries after eliminating duplicates
(B) It returns rows for the combined queries along with duplicate values
(C) It returns rows for the combined queries ignoring the null values
(D) It returns rows for the combined queries along with Null Values
Correct Option: B Explanation:
The UNION ALL operator returns rows for the combined queries along with duplicate
values
Question : 33

Consider the schedule of transaction

Ti T2

read(/\)
read(y4)
write(j4)
write(/\)

The schedule may suffer from

A. Dirty Read Problem

B. Unrepeatable Read
Problem
C. Lost Update Problem
D. Phantom Read Problem
Correct Option: C
Explanation:
The value written by the transaction T2 is lost because of the write of the transaction Tl.This is
known as lost update problem.
Question : 34

According to two-phase locking, when locks cannot be acquired?

A. Before all read and write actions
B. Before the last read or write action
C. After the first unlock action

D. Only upon commit or rollback

Correct Option : C Explanation:
According to two-phase locking, locks can not be acquired after the first unlock
action.
Question : 35

Which of the following is true with respect to functional dependency?

(A) A Functional dependency is a many-to-one relationship between two sets of attributes

(B) A Functional dependency is a one-to-many relationship between two sets of attributes
(C) A dependency preserving decomposition is that in which each functional dependency x^ y
specifies in set F of FD's should only appear directly in one of the relation schema Ri in the
decomposition
(D) None of the above

Correct Option: D Explanation:

All above statements are false
-As functional dependency is many to many .
-Dependency can appear directly or indirectly.
Question : 36

Consider the statement below

(51) Physical Data Independence - the ability to modify the physical schema without changing the
logical schema.
(52) Add/Modify/Delete a new attribute, entity or relationship is possible without a rewrite of
existing application programs is an example of physical data independence.

Which of the above is true.

(A) Only S1
(B) Only S2
(C) Both S1 and S2
(D) None of the above
Correct Option: A
Explanation:
Correct Statement:
Physical Data Independence - the ability to modify the physical schema without changing the logical
schema.
Question : 37

Consider the statements below

(51) The deferred database modification scheme records all modifications to the log, but defers
all the writes to after partial commit
(52) The immediate database modification scheme allows database updates of an uncommitted
transaction to be made as the writes are issued
Which of the above is not True.
(A) Only S1
(B) Only S2
(C) Both S1 and S2
(D) None of the above
Correct Option: D
Explanation:
Both Statements are true.
(51) The deferred database modification scheme records all modifications to the log, but defers
all the writes to after partial commit
(52) The immediate database modification scheme allows database updates of an uncommitted
transaction to be made as the writes are issued
Question : 38

An index whose search key specifies an order different from the sequential order of the file, is
called
(A) Primary Index
(B) Clustering Index
(C) Non-Clustering Index

(D) None of the above

Correct Option: C Explanation:
An index whose search key specifies an order different from the sequential order of the file. Also
called non-clustering index.
Question : 39

The tree protocol does not ensures

(i) conflict serializability and freedom from
deadlock.
(ii) recoverability or cascade freedom
(A) Only (i)
(B) Only(ii)
(C) Both (i) and(ii)

(D) None of the above

Correct
Option: B
Explanation:
but,Tree -Protocol does not guarantee recoverability or cascade freedom
•Need to introduce commit dependencies to ensure recoverability
Question : 40

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) 1
(B) 2
(C) 3
(D) 4
Correct Option: B

Since the maximum number of keys is 5, maximum number of children a node can have is 6. 6/2
= 3. Therefore, minimum number of keys that a node can 2