DBMS- Normalization Questions and Answers
Practice ModeShowing 10 of 26 questions
Q1
Normalization is a process of decomposing a set of relations with anomalies to produce smaller and well-structured relations that contains minimum or no redundancy.
Answer: Option A
Q2
A relation is said to be in 1NF if the values in the domain of each attribute of the relation are non-atomic.
Answer: Option B
Q3
1NF contains no redundant information.
Answer: Option B
Q4
2Nf is always in 1NF.
Answer: Option A
Q5
When a relation R in 2NF with FDs A--->B and B--->CDEF (where A is the only candidate key), is deconposed into two relations R1 (with A-->B) and R2 (with B-->CDEF), the relations R1 and R2
(a) are always a lossless decomposition of R.
(b) usually have total combined storage space less than R.
(c) have no delete anomalies.
(d) will always be faster to execute a query than R.
Answer: Option A
Q6
2NF is the removal of the partial functional dependencies or redundant data.
Answer: Option A
Q7
When a relation R in 3NF with FDs AB ----->C and C--->B is decomposed into two relations R1 (with AB---->null, that is, all key) and R2 (with C---->B), the relations R1 and R2
(a) are always dependency preserving.
(b) usually have total combined storage space less than R.
(c) have no delete anomalies.
Answer: Option A
Q8
In 3NF, no non-prime attribute is functionally dependent on another no-prime attribute.
Answer: Option B
Q9
In BCNF, a relation must only have candidate keys as determinants.
Answer: Option A
Q10
Lossless-join dependency is a property of decomposition, which ensures that no spurious tuples are generated when relations are returned through a natural join operation.
Answer: Option A