adplus-dvertising

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.

frame-decoration

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 10 of 11

Explore more Topics under GATE CSE Exam

Q91.
Given the following input (4322, 1334, 1471, 9679, 1989, 6171, 6173, 4199) and the hash function x mod 10, which of the following statements are true?

1. 9679, 1989, 4199 hash to the same value
2. 1471, 6171 hash to the same value
3. All elements hash to the same value
4. Each element hashes to a different value

a.

1 only

b.

2 only

c.

1 and 2 only

d.

3 or 4

Discuss
Answer: (c).1 and 2 only
Q92.
Let R1 (A, B, C) and R2 (D, E) be two relation schema, where the primary keys are shown underlined, and let C be a foreign key in R1 referring to R2. Suppose there is no violation of the above referential integrity constraint in the corresponding relation instances r1 and r2. Which one of the following relational algebra expressions would necessarily produce an empty relation ?

a.

1

b.

2

c.

3

d.

4

Discuss
Answer: (b).2
Q93.
Consider the relation Student (name, sex, marks), where the primary key is name, pertaining to students in a class that has at least one boy and one girl. What does the following relational algebra expression produce?
(Note: r is the rename operator). The condition in join is "(sex = female ^ x = male ^ marks ≤ m)"

a.

names of girl students with the highest marks

b.

names of girl students with more marks than some boy student

c.

names of girl students with marks not less than some boy students4)

d.

names of girl students with more marks than all the boy students

Discuss
Answer: (d).names of girl students with more marks than all the boy students
Q94.
How many serial schedules are possible using n-transactions?

a.

(n-1)!

b.

n!

c.

n(n-1)!

d.

n(n+1)! / 2

Discuss
Answer: (b).n!
Q95.
Which of the following is wrong?
The goal of concurrent execution is

a.

Improved Throughput

b.

Reduced Probability of Deadlock

c.

Improved resource Utilization

d.

Reduced waiting time

Discuss
Answer: (b).Reduced Probability of Deadlock
Q96.
Consider the following ordering of transactions:

T1 : R(X); T2 : R(X); T1 : w(x); T1 : r(y); T2 : w(x); T2 : Commit; T1: w(y) ; T1: Commit

Which of the following is true?

a.

It is a strict schedule

b.

Cascade less schedule

c.

Irrecoverable

d.

Recoverable

Discuss
Answer: (b).Cascade less schedule
Q97.
In strict two-phase locking protocol

a.

All exclusive mode lock taken by transaction be held until transaction commits

b.

All exclusive mode locks taken by transaction can be released before transaction commits

c.

All locks can be released before transaction commits

d.

None of these

Discuss
Answer: (a).All exclusive mode lock taken by transaction be held until transaction commits
Q98.
Is the corresponding schedule is conflict serializable schedule?

a.

Yes

b.

No

c.

Can't say

d.

None of these

Discuss
Answer: (a).Yes
Q99.
Suppose three are 3 transactions T22, T23, T24 with timestamps 10, 20, 30. Now T23 occupies a data item that is required by T22 and T24. Among the four possibilities what will be true in wait–die schema?

a.

If T22 request the data item, T22 will wait

b.

If T24 request the data item, T24 will wait

c.

If T22 request the data item, T23 will wait

d.

If T24 request the data item, T23 will wait

Discuss
Answer: (a).If T22 request the data item, T22 will wait
Q100.
Two transactions T₁ and T₂ are given as follows:

T₁: r₁ (A); w₁(A); r₁ (B); w₁(B)

Find the no. of conflict serializable schedules that can be formed over T₁ and T₂.

a.

12

b.

13

c.

14

d.

15

Discuss
Answer: (d).15
Page 10 of 11

Suggested Topics

Are you eager to expand your knowledge beyond DBMS? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!

Reverse Engineering

Strengthen your understanding of Reverse Engineering with our curated set of MCQs....

Human Computer Interaction

Enhance your knowledge of Human-Computer Interaction with our specialized MCQs....

JavaScript

Strengthen your web development skills with our JavaScript MCQs. Understand core...

Computer Graphics

Step into the visual side of computing with our Computer Graphics MCQs. Cover topics...

Software Engineering

Learn about the systematic approach to developing software with our Software...

Java Spring Framework

Enhance your Java development skills with our Spring Framework MCQs. Learn about...

Digital Logic Design

Understand the foundation of digital computers with our Digital Logic Design MCQs....

PHP

Venture into server-side scripting with our PHP MCQs. Cover everything from syntax...

Cyber Security

Understand the fundamentals of safeguarding digital assets with our Cyber Security...