Normal Form


Q11.

A prime attribute of a relation scheme R is an attribute that appears
GateOverflow

Q12.

Every time the attribute A appears, it is matched with the same value of attribute B but not the same value of attribute C. Which of the following is true?
GateOverflow

Q13.

Consider the schema R(A,B,C,D) and the functional dependencies A \rightarrow B and C \rightarrow D. If the decomposition is made as R_{1}(A, B) and R_{2}(C, D), then which of the following is TRUE?
GateOverflow

Q14.

Given the following two statements: S1: Every table with two single-valued attributes is in 1NF, 2NF, 3NF and BCNF S2 : AB\rightarrowC, D\rightarrow E, E\rightarrowC is a minimal cover for the set of functional dependencies AB\rightarrowC, D\rightarrowE, AB\rightarrow E,E\rightarrowC. Which one of the following is CORRECT?
GateOverflow

Q15.

Consider the following dependencies and the BOOK table in a relational database design. Determine the normal form of the given relation. ISBN \rightarrow Title ISBN \rightarrow Publisher Publisher \rightarrow Address
GateOverflow

Q16.

Consider the following tableThe table is in which normal form?
GateOverflow

Q17.

Consider the relation X(P,Q,R,S,T,U) with the following set of functional dependencies F= {{P,R}\rightarrow{S,T}, {P,S,U}\rightarrow{Q,R} } Which of the following is the trivial functional dependency in F^{+}, where F^{+} is closure of F ?
GateOverflow

Q18.

In functional dependency Armstrong inference rules refers to
GateOverflow

Q19.

Which of the following is TRUE?
GateOverflow

Q20.

Relation R has eight attributes ABCDEFGH. Fields of R contain only atomic values. F=\{CH\rightarrow G, A\rightarrow BC,B\rightarrow CFH,E\rightarrow A,F\rightarrow EG\} is a set of functional dependencies (FDs) so that F^{+} is exactly the set of FDs that hold for R. How many candidate keys does the relation R have?
GateOverflow