Question
a.
2NF
b.
5NF
c.
4NF
d.
3NF
Posted under Normalization DBMS
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Which normal form is considered adequate for normal relational database design?
Similar Questions
Discover Related MCQs
Q. Consider a schema R(A, B, C, D) and functional dependencies A -> B and C -> D. Then the decomposition of R into R1 (A, B) and R2(C, D) is
View solution
Q. Relation R with an associated set of functional dependencies, F, is decomposed into BCNF. The redundancy (arising out of functional dependencies) in the resulting set of relations is
View solution
Q. A table has fields F1, F2, F3, F4, and F5, with the following functional dependencies:
F1->F3
F2->F4
(F1,F2)->F5
in terms of normalization, this table is in
View solution
Q. Consider the following functional dependencies in a database.
Date_of_Birth->Age Age->Eligibility
Name->Roll_number Roll_number->Name
Course_number->Course_name Course_number->Instructor
(Roll_number, Course_number)->Grade
The relation (Roll_number, Name, Date_of_birth, Age) is
View solution
Q. The relation schema Student_Performance (name, courseNo, rollNo, grade) has the following FDs:
name,courseNo->grade
rollNo,courseNo->grade
name->rollNo
rollNo->name
The highest normal form of this relation scheme is
View solution
Q. The relation EMPDT1 is defined with attributes empcode(unique), name, street, city, state, and pincode. For any pincode,there is only one city and state. Also, for any given street, city and state, there is just one pincode. In normalization terms EMPDT1 is a relation in
View solution
Q. Which one of the following statements if FALSE?
View solution
Q. A relation is in ____________ if an attribute of a composite key is dependent on an attribute of other composite key.
View solution
Q. What are the desirable properties of a decomposition ?
View solution
Q. R (A,B,C,D) is a relation. Which of the following does not have a lossless join dependency preserving BCNF decomposition.
View solution
Q. The algorithm that takes a set of dependencies and adds one schema at a time, instead of decomposing the initial schema repeatedly is
View solution
Q. The functional dependency can be tested easily on the materialized view, using the constraints ____________.
View solution
Suggested Topics
Are you eager to expand your knowledge beyond DBMS? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
