Welcome to the DBMS MCQs Page

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

Check out the MCQs below to embark on an enriching journey through DBMS. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of GATE CSE Exam.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of DBMS. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

DBMS MCQs | Page 6 of 11

Explore more Topics under GATE CSE Exam

01

Networking

02

Operating System

03

Data Structures and Algorithms

04

Computer Architecture

05

Compiler Design

06

Theory of Computation(TOC)

07

Engineering Mathematics

Q51.

Let r be a relation instance with schema R = (A, B, C, D). We define r1 = ΠA, B, C (r) and r2 = ΠA.D (r). Let s = r1 * r2 where * denotes natural join. Given that the decomposition of r into r1 and r2 is lossy, which one of the following is TRUE?

s ⊂ r

r ∪ s

r ⊂ s

r * s = s

Discuss

Answer: (c).r ⊂ s

Q52.

Consider a relation scheme R = (A, B, C, D, E, H) on which the following functional dependencies hold: {A–>B, BC–>D, E–>C, D–>A}. What are the candidate keys of R?

AE, BE

AE, BE, DE

AEH, BEH, BCH

AEH, BEH, DEH

Discuss

Answer: (d).AEH, BEH, DEH

Q53.

The relation scheme Student Performance (name, courseNo, rollNo, grade) has the following functional dependencies:
name, courseNo → grade
rollNo, courseNo → grade
name → rollNo
rollNo → name
The highest normal form of this relation scheme is

2 NF

3 NF

BCNF

4NF

Discuss

Answer: (b).3 NF

Q54.

Consider the following functional dependencies in a database:

Data_of_Birth → Age
Age → Eligibility
Name → Roll_number
Roll_number → Name
Course_number → Course_name
Course_number → Instructor
(Roll_number, Course_number) → Grade

The relation (Roll_number, Name, Date_of_birth, Age) is:

In second normal form but not in third normal form

In third normal form but not in BCNF

In BCNF

None of the above

Discuss

Answer: (d).None of the above

Q55.

Relation R with an associated set of functional dependencies, F is decomposed into BCNF. The redundancy (arising out of functional dependencies) in the resulting set relations is.

Zero

More than zero but less than that of an equivalent 3NF decomposition

Proportional to the size of F+

Indeterminate

Discuss

Answer: (a).Zero

Q56.

With regard to the expressive power of the formal relational query languages, which of the following statements is true?

Relational algebra is more powerful than relational calculus

Relational algebra has the same power as relational calculus

Relational algebra has the same power as safe relational calculus

None of the above

Discuss

Answer: (c).Relational algebra has the same power as safe relational calculus

Q57.

Relation R is decomposed using a set of functional dependencies, F and relation S is decomposed using another set of functional dependencies G. One decomposition is definitely BCNF, the other is definitely 3NF, but it is not known which is which. To make a guaranteed identification, which one of the following tests should be used on the decompositions? (Assume that the closures of F and G are available).

Dependency-preservation

Lossless-join

BCNF definition

3NF definition

Discuss

Answer: (c).BCNF definition

Q58.

From the following instance of a relation scheme R (A, B, C), we can conclude that :
A B C
1 1 1
1 1 0
2 3 2
2 3 2

A functionally determines B and B functionally determines C

A functionally determines B and B does not functionally determine C

B does not functionally determine C

A does not functionally determine B and B does not functionally determine C

Discuss

Answer: (c).B does not functionally determine C

Q59.

Consider a schema R(A,B,C,D) and functional dependencies A->B and C->D. Then the decomposition of R into R1(AB) and R2(CD) is

dependency preserving and lossless join

lossless join but not dependency preserving

dependency preserving but not lossless join

not dependency preserving and not lossless join

Discuss

Answer: (c).dependency preserving but not lossless join

Q60.

Suppose the adjacency relation of vertices in a graph is represented in a table Adj(X,Y). Which of the following queries cannot be expressed by a relational algebra expression of constant length?

List of all vertices adjacent to a given vertex

List all vertices which have self loops

List all vertices which belong to cycles of less than three vertices

List all vertices reachable from a given vertex

Discuss

Answer: (d).List all vertices reachable from a given vertex

Page 6 of 11

Welcome to the DBMS MCQs Page

DBMS MCQs | Page 6 of 11

Explore more Topics under GATE CSE Exam

Networking

Operating System

Data Structures and Algorithms

Computer Architecture

Compiler Design

Theory of Computation(TOC)

Engineering Mathematics

Suggested Topics

Neural Networks

Digital Image Processing (DIP)

UNIX

Data Structures and Algorithms

Digital Communication

Systems Analysis and Design Methods

Hadoop

C# programming

Web Technologies