adplus-dvertising

Welcome to the Normalization MCQs Page

Dive deep into the fascinating world of Normalization with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Normalization, a crucial aspect of DBMS. In this section, you will encounter a diverse range of MCQs that cover various aspects of Normalization, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within DBMS.

frame-decoration

Check out the MCQs below to embark on an enriching journey through Normalization. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of DBMS.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Normalization. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Normalization MCQs | Page 12 of 12

Q111.
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
Discuss
Answer: (b).3NF
Q112.
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
Discuss
Answer: (b).2NF and hence also in 1NF
Discuss
Answer: (d).A prime attribute can be transitively dependent on a key in a BCNF relation
Q114.
A relation is in ____________ if an attribute of a composite key is dependent on an attribute of other composite key.
Discuss
Answer: (b).3NF
Q115.
What are the desirable properties of a decomposition ?
Discuss
Answer: (b).Dependency preservation
Q116.
R (A,B,C,D) is a relation. Which of the following does not have a lossless join dependency preserving BCNF decomposition.
Discuss
Answer: (d).A->BCD
Q117.
Consider the below conditions. Which of the following relation holds ?
Class (course id, title, dept name, credits, sec id, semester, YEAR, building, room NUMBER, capacity, TIME slot id)
The SET OF functional dependencies that we require TO hold ON class are:
course id->title, dept name, credits
building, room number->capacity
course id, sec id, semester, year->building, room NUMBER, TIME slot id
A candidate KEY FOR this schema IS {course id, sec id, semester, YEAR}
Discuss
Answer: (a).Course id-> title, dept name, credits
Q118.
The algorithm that takes a set of dependencies and adds one schema at a time, instead of decomposing the initial schema repeatedly is
Discuss
Answer: (c).3NF synthesis algorithm
Q119.
The functional dependency can be tested easily on the materialized view, using the constraints ____________.
Discuss
Answer: (d).Both Null and Unique
Page 12 of 12

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!