solution - DBMS (Database Management System) : Normalization (Test 3)

Question : If a decomposition results in spurious tuples after join, it is:

Solution :
554220260427091036 Correct Answer : Lossy decomposition

Description -

DBMS (Database Management System) : Normalization (Test 3)

Question : Which of the following combinations represents the types of decomposition?

Solution :
717220260427090958 Correct Answer : Lossy and Lossless

Description -

DBMS (Database Management System) : Normalization (Test 3)

Question : A decomposition is dependency preserving if:

Solution :
271620260427090920 Correct Answer : All functional dependencies can be enforced without joining relations

Description -

DBMS (Database Management System) : Normalization (Test 3)

Question : Which of the following is NOT a goal of relational decomposition?

Solution :
956020260427090849 Correct Answer : Increase data duplication

Description -

DBMS (Database Management System) : Normalization (Test 3)

Question : Which condition ensures that a decomposition of a relation is lossless join?

Solution :
276820260427090808 Correct Answer : Common attributes form a superkey in at least one relation

Description -

DBMS (Database Management System) : Normalization (Test 3)

Question : Which normal form specifically deals with eliminating multivalued dependencies?

Solution :
605320260427090707 Correct Answer : 4NF

Description -

DBMS (Database Management System) : Normalization (Test 3)

Question : A relation has attributes Employee, Skill, Language, where skills and languages are independent but both depend on Employee. This situation represents:

Solution :
105720260427090625 Correct Answer : Multivalued Dependency

Description -

DBMS (Database Management System) : Normalization (Test 3)

Question : Which of the following statements about multivalued dependency is FALSE?

Solution :
829520260427090539 Correct Answer : It is a special case of functional dependency

Description -

DBMS (Database Management System) : Normalization (Test 3)

Question : In a relation R(A, B, C), if A →→ B, which of the following must also hold (assuming attributes are independent)?

Solution :
450520260427090502 Correct Answer : A →→ C

Description -

DBMS (Database Management System) : Normalization (Test 3)

Question : Which of the following best defines a multivalued dependency (MVD)?

Solution :
788720260427090424 Correct Answer : One attribute determines multiple independent values of another attribute

Description -

DBMS (Database Management System) : Normalization (Test 3)

Question : Which of the following indicates a lossy join?

Solution :
954120260427090219 Correct Answer : Some tuples are lost or spurious tuples are generated

Description -

DBMS (Database Management System) : Normalization (Test 3)

Question : Which normal form is primarily based on Join Dependency?

Solution :
621220260427090146 Correct Answer : 5NF

Description -

DBMS (Database Management System) : Normalization (Test 3)

Question : Join dependency is a generalization of which concept?

Solution :
565820260427090102 Correct Answer : Multivalued Dependency

Description -

DBMS (Database Management System) : Normalization (Test 3)

Question : A join dependency is considered trivial when:

Solution :
277620260427090032 Correct Answer : The join of decomposed relations gives the original relation without adding value

Description -

DBMS (Database Management System) : Normalization (Test 3)

Question : Which of the following best defines a Join Dependency (JD)?

Solution :
797420260427085727 Correct Answer : A condition where a relation can be reconstructed by joining its projections

Description -

DBMS (Database Management System) : Normalization (Test 3)

Question : Which scenario violates inclusion dependency?

Solution :
9720260427085042 Correct Answer : Some foreign key values are missing in the parent table

Description -

DBMS (Database Management System) : Normalization (Test 3)

Question : Given relations R(A, B) and S(C, D), which condition shows inclusion dependency?

Solution :
846820260427085011 Correct Answer : R[A] ⊆ S[C]

Description -

DBMS (Database Management System) : Normalization (Test 3)

Question : Inclusion dependency is most closely related to:

Solution :
258320260427084926 Correct Answer : Foreign key constraint

Description -

DBMS (Database Management System) : Normalization (Test 3)

Question : Which of the following best represents inclusion dependency?

Solution :
337420260427084849 Correct Answer : R[X] ⊆ S[Y]

Description -

DBMS (Database Management System) : Normalization (Test 3)

Question : In DBMS, an inclusion dependency (IND) states that:

Solution :
515420260427084754 Correct Answer : Values of one relation must be a subset of another relation

Description -

DBMS (Database Management System) : Normalization (Test 3)

Question : Which of the following statements about canonical cover is TRUE?

Solution :
414720260427084642 Correct Answer : It may have multiple equivalent forms

Description -

DBMS (Database Management System) : Normalization (Test 3)

Question : An attribute in a functional dependency is called extraneous if:

Solution :
551720260427084559 Correct Answer : It can be removed without affecting closure

Description -

DBMS (Database Management System) : Normalization (Test 3)

Question : Which step is NOT part of computing a canonical cover?

Solution :
258520260427084502 Correct Answer : Adding transitive dependencies explicitly

Description -

DBMS (Database Management System) : Normalization (Test 3)

Question : Given F = { A → BC, B → C, A → B }, what is the canonical cover?

Solution :
10520260427084103 Correct Answer : { A → B, B → C }

Description -

DBMS (Database Management System) : Normalization (Test 3)

Question : Which of the following best defines a canonical cover of a set of functional dependencies?

Solution :
778420260427083957 Correct Answer : A minimal set of dependencies equivalent to the original set

Description -

DBMS (Database Management System) : Normalization (Test 3)