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 2 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

Q11.

What action does ⋈ operator perform in relational algebra

Output specified attributes from all rows of the input relation and remove duplicate tuples from the output

Outputs pairs of rows from the two input relations that have the same value on all attributes that have the same name

Output all pairs of rows from the two input relations (regardless of whether or not they have the same values on common attributes)

Return rows of the input relation that satisfy the predicate

Discuss

Answer: (a).Output specified attributes from all rows of the input relation and remove duplicate tuples from the output

Q12.

What does the “x” operator do in relational algebra?

Output specified attributes from all rows of the input relation. Remove duplicate tuples from the output

Output pairs of rows from the two input relations that have the same value on all attributes that have the same name

Output all pairs of rows from the two input relations (regardless of whether or not they have the same values on common attributes)

Returns the rows of the input relation that satisfy the predicate

Discuss

Answer: (c).Output all pairs of rows from the two input relations (regardless of whether or not they have the same values on common attributes)

Q13.

An attribute is a __________ in a relation.

Row

Column

Value

Tuple

Discuss

Answer: (b).Column

Q14.

What is the method of specifying a primary key in a schema description?

By writing it in bold letters

By underlining it using a dashed line

By writing it in capital letters

By underlining it using a bold line

Discuss

Answer: (d).By underlining it using a bold line

Q15.

Statement 1: A tuple is a row in a relation
Statement 2: Existence of multiple foreign keys in a same relation is possible

Both the statements are true

Statement 1 is correct but Statement 2 is false

Statement 1 is false but Statement 2 is correct

Both the statements are false

Discuss

Answer: (a).Both the statements are true

Q16.

Choose the option that correctly explains in words, the function of the following relational algebra expression:
σyear≥2009 (book ⋈ borrow)

Selects all tuples from the Cartesian product of book and borrow

Selects all the tuples from the natural join of book and borrow wherever the year is lesser than 2009

Selects all the tuples from the natural join of book and student wherever the year is greater than or equal to 2009

Selects all tuples from the Cartesian product of book and borrow wherever the year is greater than or equal to 2009

Discuss

Answer: (b).Selects all the tuples from the natural join of book and borrow wherever the year is lesser than 2009

Q17.

State true or false: If a relation consists of a foreign key, then it is called a referenced relation of the foreign key dependency.

True

False

May be

Can't say

Discuss

Answer: (b).False

Q18.

Which of the following is not a feature of a good relational design?

Specifying primary keys

Specifying foreign keys

Preserving integrity constraints

Allowing redundancy of attributes

Discuss

Answer: (d).Allowing redundancy of attributes

Q19.

The dependency rules specified by the database designer are known as _______

Designer dependencies

Database rules

Functional dependencies

None of the mentioned

Discuss

Answer: (c).Functional dependencies

Q20.

If the decomposition is unable to represent certain important facts about the relation, then such a decomposition is called as?

Lossless decomposition

Lossy decomposition

Insecure decomposition

Secure decomposition

Discuss

Answer: (b).Lossy decomposition

Page 2 of 8

Welcome to the RDBMS MCQs Page

RDBMS MCQs | Page 2 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

PHP

Java Programming

C Programming

Data Science

Embedded Systems

Computer Architecture

Operating System

UNIX

Neural Networks