Datebase Normalization
The process of producing a simpler and more reliable database structure is called normalization. It is used to create a suitable set of relations for storing data. This process works through different stages known as normal forms. These stages are 1NF, 2NF, 3NF and so on. Each normal form has certain requirements or conditions. These conditions have to be fulfilled to bring the database in that particular normal form. If a relation satisfies the conditions of a normal form, it is said to be in that normal form.
The task of database design starts with an unnormalized set of relations. The process of normalisation identifies and corrects the problems and complexities of database design. It produces a new set of relations. The new design is as free of processing problems as possible.
DBMS mcqs with answers set 9 includes the mcqs of relational data integrity, referential integrity, datebase anomalies, types of anomalies, normalization, functional dependency, first normal form, second normal form, third normal form, transitive dependency, fourth normal form and Boyce-Codd normal form (BCNF). These database mcqs are very helpful for those who are preparing UGC NET, GATE exam, PPSC lecture computer science test 2020, database designer job test, database developer jobs test, SPSC, FPSC, KPPSC OR CSS based private or government jobs. Its also very helpful for international students who want to be appear in Microsoft SQL and Oracle certification exams.
Database Management System MCQ Set 9
1. In relational databases, the table is also called _____?A). Tuple
B). Relation
C). File
D). Schema
View Answer
2. In 3NF a non key attribute must not depend on a _____?
A). Non key attribute
B). Key attribute
C). Composite key
D). Sort key
View Answer
3. Different attributes in two different tables having same name are referred to as _____?
A). Synonym
B). Homonym
C). Acronym
D). Mutually exclusive
View Answer
4. Every relation must have _____?
A). Primary key
B). Candidate key
C). Secondary key
D). Mutually exclusiveness
View Answer
5. The Entity integrity rules states that _____?
A). No primary key attribute can be null
B). Each entity must have a primary key
C). Primary key must have only one attribute
D). None of these
View Answer
6. A rule that states that each foreign key value must match a primary key value in the other relation is called _____?
A). Referential integrity constraint
B). Key match rule
C). Entity key group rule
D). Foreign / primary match rule
View Answer
7. Two or more attributes having different names but same meaning are called _____?
A). Homonym
B). Aliases
C). Synonym
D). Alternate attributes
View Answer
8. A constraint between two attributes is called _____?
A). Functional relation
B). Attribute dependency
C). Functional dependency
D). Functional relation constraint
View Answer
9. The attribute on the left hand side of the arrow In a functional dependency is _____?
A). Candidate key
B). Determinant
C). Foreign key
D). Primary key
View Answer
10. The goal of normalization is to ____?
A). Get stable data structure
B). Increase number of relation
C). Increase redundancy
D). None of these
View Answer
11. A relation is in 2NF if it is in 1NF and all its non key attributes are _____?
A). Dependent on part of the primary key
B). Dependent on the entire primary key
C). Independent of the primary key
D). Independent of any other relation
View Answer
12. In 2NF which forms of dependency is removed?
A). Functional
B). Partial
C). Associative
D). Transitive
View Answer
13. Which of the following are anomalies that can be caused by redundancy in tables?
A). Insertion
B). Deletion
C). Modification
D). All
View Answer
14. A functional dependency between two or more non key attributes is called _____?
A). Partial functional dependency
B). Partial non-key dependency
C). Transitive dependency
D). None of these
View Answer
15. Which of the following anomalies result from a transitive dependency?
A). Insertion
B). Modification
C). Deletion
D). All
View Answer
16. A relation is in third normal form if it is in second normal form and _____?
A). Dependent on part of the key
B). Dependent on all of the key
C). Independent of the key
D). Has no transitive dependencies
View Answer
17. A relation that contains minimal redundancy and allows easy use is called _____?
A). Clean
B). Simple
C). Complex
D). Well-structured
View Answer
18. The 1NF describes the tabular format in which ____?
A). All the key attributes are defined
B). No repeating groups in the table
C). All attributes are dependent on the primary key
D). All
View Answer
:>>Watch Top 12 Dangerous Beaches in the World
19. In a functional dependency the determinant _____?A). Will be paired with one value of the dependent attribute
B). May be paired with one or more values of the dependent attribute
C). May consists of more than one attribute
D). a and c
View Answer
20. When the determinant contains two attributes?
A). The first attribute determines the dependent attribute
B). The second attribute determines the dependent attribute
C). Both attributes determine the dependent attribute
D). Either the first or second attribute determines the dependent attribute
View Answer
21. An anomaly in a relation is _____?
A). An unusual data value
B). A duplicate data value caused by changing the data
C). An undesirable consequence of changing the data
D). An error in the design
View Answer
22. Restrictions on operations on a relation are called _____?
A). Deletion anomalies
B). Insertion anomalies
C). Modification anomalies
D). Referential integrity constraints
View Answer
23. The normalization process generally?
A). Reduces the number of relations
B). Increases the number of relations
C). Reduces the number of functional dependencies
D). Increases the number of functional dependencies
View Answer
24. A relation is automatically in _____?
A). First Normal Form
B). Second normal form
C). Third normal form
D). Boyce-Codd normal form
View Answer
25. A relation is in domain/key normal form if?
A). Every key of relation is a logical consequences of definition of constraints and determinants
B). Every key of relation is a logical consequence of definition of constraint and domains
C). Every constraint on relation is a logical consequence of definition of keys and determinants
D). Every constraint on relation is a logical consequence of definition of keys and domains
View Answer
Read also>->>Database MCQs With Answers Set 6
Read also>->>Database MCQs With Answers Set 7
Read also>->>Database MCQs With Answers Set 8
Read also>->>Database MCQs With Answers Set 10
.jpg)