DBMS GATE previous year questions with answer

Ques 27 Gate 2015 Set-3

Consider the relation X(P, Q, R, S, T, U) with the following set of functional dependencies

F = {
        {P, R} → {S,T},
        {P, S, U} → {Q, R}
}

Which of the following is the trivial functional dependency in F⁺ is closure of F?

Ques 28 Gate 2015 Set-3

Consider the following relation

Cinema (theater, address, capacity)

Which of the following options will be needed at the end of the SQL query

SELECT P1. address FROM Cinema P1

Such that it always finds the addresses of theaters with maximum capacity?

Ques 29 Gate 2015 Set-2

Consider the following transaction involving two bank accounts x and y.

read(x); x := x – 50; write(x); read(y); y := y + 50; write(y)

The constraint that the sum of the accounts x and y should remain constant is that of

Ques 30 Gate 2015 Set-1

A file is organized so that the ordering of data records is the same as or close to the ordering of data entries in some index. Then that index is called

Ques 31 Gate 2015 Set-1

Select operation in SQL is equivalent to