• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

50 DBMS MCQs with Answers

Question 1

In E-R model, Y is the dominant entity and X is subordinate entity
  • If X is deleted, then Y is also deleted
  • If Y is deleted, then X is also deleted
  • If Y is deleted, then X is not deleted
  • None of the above

Question 2

Let R1 (a, b, c) and R2 (x, y, z) be two relations in which a is the foreign key of R1 that refers to the primary key of R2 . Consider following four options. (a)Insert into R 1 (b)Insert into R 2 (c)Delete from R 1 (d)Delete from R 2 Which of the following is correct about the referential integrity constraint with respect to above?
  • Operations (a) and (b) will cause violation.
  • Operations (b) and (c) will cause violation.
  • Operations (c) and (d) will cause violation.
  • Operations (d) and (a) will cause violation.

Question 3

How to express that some person keeps animals as pets?
  • (A)
  • (B)
  • (C)
  • (D)

Question 4

A view of database that appears to an application program is known as
  • Schema
  • Subschema
  • Virtual table
  • None of these

Question 5

Which operation is used to extract specified columns from a table?
  • Project
  • Join
  • Extract
  • Substitute

Question 6

The relation schemas R1 and R2 form a Lossless join decomposition of R if and only if: (a) R1 ∩ R2 ↠ (R1 - R2) (b) R1 → R2 (c) R1 ∩ R2 ↠ (R2 - R1 ) (d)(R2 → R1) ∩ R2
  • (a) and (b) happens
  • (a) and (d) happens
  • (a) and (c) happens
  • (b) and (c) happens

Question 7

In functional dependency Armstrong inference rules refers to
  • Reflexivity, Augmentation and Decomposition
  • Transitivity, Augmentation and Reflexivity
  • Augmentation, Transitivity, Reflexivity and Decomposition
  • Reflexivity, Transitivity and Decomposition

Question 8

Which of the following statements is FALSE about weak entity set?
  • Weak entities can be deleted automatically when their strong entity is deleted.
  • Weak entity set avoids the data duplication and consequent possible inconsistencies caused by duplicating the key of the strong entity.
  • A weak entity set has no primary keys unless attributes of the strong entity set on which it depends are included
  • Tuples in a weak entity set are not partitioned according to their relationship with tuples in a strong entity set.

Question 9

Relation R has eight attributes ABCDEFGH. Fields of R contain only atomic values. F = {CH -> G, A -> BC, B -> CFH, E -> A, F -> EG} is a set of functional dependencies (FDs) so that F+ is exactly the set of FDs that hold for R. How many candidate keys does the relation R have?
  • 3
  • 4
  • 5
  • 6

Question 10

In RDBMS, different classes of relations are created using __________ technique to prevent modification anomalies.
  • Functional Dependencies
  • Data integrity
  • Referential integrity
  • Normal Forms

There are 50 questions to complete.

Last Updated :
Take a part in the ongoing discussion