Free Mock Test : DBMS (Database Management System) : Normalization (Test 3)

Home

Technology

Blog

Free Mock Test - DBMS (Database Management System) : Normalization (Test 3)

Normalization remains one of the most important and frequently asked topics in DBMS for competitive examinations like NIC, TRE, Banking, SSC, and other technical recruitment tests. Candidates are advised to have a clear conceptual understanding as well as problem-solving ability in this area.
In the ever-evolving landscape of computer-based competitive examinations such as NIC, TRE, and various Banking exams, Database Management System (DBMS) continues to be a high-weightage subject. Among its core topics, Normalization has emerged as a frequently tested and conceptually important area, especially in technical and IT-related papers.

Total Questions : 25

Timer : sec

Question : If a decomposition results in spurious tuples after join, it is:

Lossless decomposition

Dependency preserving

Lossy decomposition

Normalized decomposition

Question : Which of the following combinations represents the types of decomposition?

Logical and Physical

Lossy and Lossless

Static and Dynamic

Simple and Complex

Question : A decomposition is dependency preserving if:

All functional dependencies can be enforced without joining relations

No functional dependencies exist

Relations are in 1NF

Only primary keys are preserved

Question : Which of the following is NOT a goal of relational decomposition?

Eliminate redundancy

Remove anomalies

Increase data duplication

Maintain data consistency

Question : Which condition ensures that a decomposition of a relation is lossless join?

Intersection of decomposed tables is empty

Common attributes form a superkey in at least one relation

Functional dependencies are removed

Number of tables increases

Question : Which normal form specifically deals with eliminating multivalued dependencies?

2NF

3NF

BCNF

4NF

Question : A relation has attributes Employee, Skill, Language, where skills and languages are independent but both depend on Employee. This situation represents:

Functional Dependency

Partial Dependency

Multivalued Dependency

Transitive Dependency

Question : Which of the following statements about multivalued dependency is FALSE?

It always involves at least three attributes

It is a special case of functional dependency

Independent attributes depend on a common attribute

It can lead to redundancy in relations

Question : In a relation R(A, B, C), if A →→ B, which of the following must also hold (assuming attributes are independent)?

A → B

A →→ C

B →→ C

C →→ A

Question : Which of the following best defines a multivalued dependency (MVD)?

One attribute determines exactly one value of another attribute

One attribute determines multiple independent values of another attribute

Two attributes determine a third attribute jointly

Every attribute depends on all other attributes

Question : Which of the following indicates a lossy join?

Original relation is perfectly reconstructed

No extra tuples are generated

Some tuples are lost or spurious tuples are generated

All keys are preserved

Question : Which normal form is primarily based on Join Dependency?

3NF

BCNF

4NF

5NF

Question : Join dependency is a generalization of which concept?

Functional Dependency

Multivalued Dependency

Candidate Key

Foreign Key Constraint

Question : A join dependency is considered trivial when:

It involves only two relations

It produces duplicate tuples

The join of decomposed relations gives the original relation without adding value

It violates normalization rules

Question : Which of the following best defines a Join Dependency (JD)?

A dependency where one attribute uniquely determines another

A condition where a relation can be reconstructed by joining its projections

A dependency between primary key and foreign key

A dependency that removes redundancy completely

Question : Which scenario violates inclusion dependency?

All foreign key values exist in the parent table

Some foreign key values are missing in the parent table

All attributes are normalized

Relations are in 3NF

Question : Given relations R(A, B) and S(C, D), which condition shows inclusion dependency?

A → B

B → A

R[A] ⊆ S[C]

R[A] = S[C]

Question : Inclusion dependency is most closely related to:

Primary key constraint

Foreign key constraint

Candidate key

Composite key

Question : Which of the following best represents inclusion dependency?

A → B

A ↠ B

R[X] ⊆ S[Y]

X ∪ Y

Question : In DBMS, an inclusion dependency (IND) states that:

Attributes are functionally dependent on each other

Values of one relation must be a subset of another relation

Attributes must be unique in a table

All attributes are independent

Question : Which of the following statements about canonical cover is TRUE?

It is always unique

It may have multiple equivalent forms

It increases redundancy

It ignores closure equivalence

Question : An attribute in a functional dependency is called extraneous if:

It appears only on the RHS

It can be removed without affecting closure

It determines all attributes

It is part of a candidate key

Question : Which step is NOT part of computing a canonical cover?

Removing extraneous attributes

Decomposing RHS into single attributes

Adding transitive dependencies explicitly

Removing redundant functional dependencies

Question : Given F = { A → BC, B → C, A → B }, what is the canonical cover?

{ A → BC, B → C }

{ A → B, B → C }

{ A → C, B → C }

{ A → BC }

Question : Which of the following best defines a canonical cover of a set of functional dependencies?

A set of dependencies with maximum attributes

A minimal set of dependencies equivalent to the original set

A set of dependencies with no transitive dependencies

A set containing only trivial dependencies

About us

Term & conditions

Privacy & Policy

Free Mock Test - DBMS (Database Management System) : Normalization (Test 3)

Cookies & Disclaimer