Top 50+ Solved Relational Database Design MCQ Questions Answer
Q. In the __________ normal form, a composite attribute is converted to individual attributes.
a. First
b. Second
c. Third
d. Fourth
Q. Tables in second normal form (2NF):
a. Eliminate all hidden dependencies
b. Eliminate the possibility of a insertion anomalies
c. Have a composite key
d. Have all non key fields depend on the whole primary key
Q. Which-one ofthe following statements about normal forms is FALSE?
a. BCNF is stricter than 3 NF
b. Lossless, dependency -preserving decomposition into 3 NF is always possible
c. Loss less, dependency – preserving decomposition into BCNF is always possible
d. Any relation with two attributes is BCNF
Q. Functional Dependencies are the types of constraints that are based on______
a. Key
b. Key revisited
c. Superset key
d. None of the mentioned
Q. Which is a bottom-up approach to database design that design by examining the relationshipbetween attributes:
a. Functional dependency
b. Database modeling
c. Normalization
d. Decomposition
Q. Which forms simplifies and ensures that there are minimal data aggregates and repetitivegroups:
a. 1NF
b. 2NF
c. 3NF
d. All of the mentioned
Q. Which forms has a relation that possesses data about an individual entity:
a. 2NF
b. 3NF
c. 4NF
d. 5NF
Q. Empdt1(empcode, name, street, city, state, pincode).For any pincode, there is only one city and state. Also, for given street, city and state, there is just one pincode. In normalization terms, empdt1 is a relation in
a. 1 NF only
b. 2 NF and hence also in 1 NF
c. 3NF and hence also in 2NF and 1NF
d. BCNF and hence also in 3NF, 2NF and 1NF
Q. We can use the following three rules to find logically implied functional dependencies.This collection of rules is called
a. Axioms
b. Armstrong’s axioms
c. Armstrong
d. Closure
Q. Which of the following is not Armstrong’s Axiom?
a. Reflexivity rule
b. Transitivity rule
c. Pseudotransitivity rule
d. Augmentation rule
Q. The relation employee(ID,name,street,Credit,street,city,salary) is decomposed intoemployee1 (ID, name)employee2 (name, street, city, salary) This type of decomposition is called
a. Lossless decomposition
b. Lossless-join decomposition
c. All of the mentioned
d. None of the mentioned
Q. Inst_dept (ID, name, salary, dept name, building, budget) is decomposed intoinstructor (ID, name, dept name, salary) department (dept name, building, budget) This comes under
a. Lossy-join decomposition
b. Lossy decomposition
c. Lossless-join decomposition
d. Both Lossy and Lossy-join decomposition
Q. There are two functional dependencies with the same set of attributes on the left side of the arrow:A->BC A->B This can be combined as
a. A->BC
b. A->B
c. B->C
d. None of the mentioned