Databases - Online Test
Q1. The following functional dependencies hold for relations R(A, B, C) and S(B, D, E) B → A,
A → C The relation R contains 200tuples and the relation S contains 100tuples. What is
the maximum number of tuples possible in the natural join R 
S?
S?
Answer : Option A
Explaination / Solution:
No Explaination.
Q2. A hash table of length 10 uses open addressing with hash function h(k)=k
mod 10, and linear probing. After inserting 6 values into an empty hash table,
the table is as shown below 
Which one of the following choices gives a possible order in which the key values
could have been inserted in the table?
Answer : Option C
Explaination / Solution:
No Explaination.
Q3. A hash table of length 10 uses open addressing with hash function h(k)=k
mod 10, and linear probing. After inserting 6 values into an empty hash table,
the table is as shown below
How many different insertion sequences of the key values using the same hash
function and linear probing will result in the hash table shown above?
Answer : Option B
Explaination / Solution:
No Explaination.
