Welcome to the RDBMS MCQs Page

Dive deep into the fascinating world of RDBMS with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of RDBMS, a crucial aspect of DBMS. In this section, you will encounter a diverse range of MCQs that cover various aspects of RDBMS, 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.

Check out the MCQs below to embark on an enriching journey through RDBMS. 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 RDBMS. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

RDBMS MCQs | Page 4 of 8

Explore more Topics under DBMS

01

DBMS Basics

02

Data Models

03

The Entity Relationship Approach

04

Relational Databases

05

Data Storage and Querying

06

Relational Algebra

07

Normalization

08

Storage and File Structures

09

Indexing and Hashing

10

Transactions

11

Concurrency Control

12

Recovery System

13

Distributed Databases

14

SQL

15

Data Warehousing and Data Mining

16

Advanced SQL

17

SQL Queries,Constraints and Triggers

Q31.

Which of the following is used to express database consistency?

Primary keys

Functional dependencies

Check clause

All of the mentioned

Discuss

Answer: (d).All of the mentioned

Q32.

Which of the following is not a condition for the third normal form in the case of X→Y?

X→ Y is trivial

X is the superkey for R

Each attribute in Y-X is a candidate key for R

Each attribute in X-Y is a candidate key for R

Discuss

Answer: (d).Each attribute in X-Y is a candidate key for R

Q33.

F+ is called as the ________ of F

Closure

Sum

Cartesian product

None of the mentioned

Discuss

Answer: (a).Closure

Q34.

State true or false: A functional dependency must first satisfy the second normal form to satisfy the third normal form.

True

False

May be

Can't say

Discuss

Answer: (a).True

Q35.

State true or false: The fourth normal form does not exist and it is instead called as the BCNF.

True

False

May be

Can't say

Discuss

Answer: (b).False

Q36.

A functional dependency f on R is _______ by a set of functional dependencies F on r if every instance of r(R) that satisfies f also satisfies F.

Logically Defined

Logically Derived

Logically implied

None of the mentioned

Discuss

Answer: (c).Logically implied

Q37.

If F is a set of functional dependencies, then the closure of F is denoted by?

F+

Discuss

Answer: (c).F+

Q38.

If a functional dependency is reflexive, B is a subset of A and A is the set of attributes, then

B→A holds

A→B holds

AB→C holds

None of the mentioned

Discuss

Answer: (b).A→B holds

Q39.

State true or false: Armstrong’s axioms allow us to generate all F+ for any given F

True

False

May be

Can't say

Discuss

Answer: (a).True

Q40.

Armstrong axioms are called sound because?

They are expensive

They cannot generate correct functional dependencies

They allow us to generate the complete closure

They cannot generate incorrect functional dependencies

Discuss

Answer: (d).They cannot generate incorrect functional dependencies

Page 4 of 8

Welcome to the RDBMS MCQs Page

RDBMS MCQs | Page 4 of 8

Explore more Topics under DBMS

DBMS Basics

Data Models

The Entity Relationship Approach

Relational Databases

Data Storage and Querying

Relational Algebra

Normalization

Storage and File Structures

Indexing and Hashing

Transactions

Concurrency Control

Recovery System

Distributed Databases

SQL

Data Warehousing and Data Mining

Advanced SQL

SQL Queries,Constraints and Triggers

Suggested Topics

DBMS

Java Programming

MATLAB

Computer Hardware

Object Oriented Programming

HTML

Systems Programming

C# programming

IT Fundamentals