DBMS | Gate 2024 Previous Year Question Solving | 3 December 2023

Gate 2024 Previous Year Question Solving | DBMS.
Solving each subject - 20 question
Relation R has eight attributes ABCDEFGH. Fields of R contain only atomic values.
F = {CH → G, A → BC, B → CFH, E → A, F → EG} is a set of functional dependencies (FDs) so that F+ is exactly the set of FDs that hold for R.
Given the following statements:
S1: A foreign key declaration can always be replaced by an equivalent check assertion in SQL.
S2: Given the table where and together form the primary key, the following is a valid table definition.
The maximum number of superkeys for the relation schema R(E,F,G,H) with E as the key is
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?
The following functional dependencies hold true for the relational schema ....
Which of the following is irreducible equivalent for this set of functional dependencies?
Consider the following tables T1 and T2:
Consider the relation with the following functional dependencies. Consider the decomposition of the relation into the constituent relations according to the following two decomposition schemes. Which one of the following options is correct?