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

Q31.

Student (school-id, sch-roll-no, sname, saddress)
School (school-id, sch-name, sch-address, sch-phone)
Enrolment(school-id sch-roll-no, erollno, examname)
ExamResult(erollno, examname, marks)

What does the following SQL query output?

SELECT sch-name, COUNT (*)
FROM School C, Enrolment E, ExamResult R
WHERE E.school-id = C.school-id
AND
E.examname = R.examname AND E.erollno = R.erollno
AND
R.marks = 100 AND S.school-id IN (SELECT school-id
FROM student
GROUP BY school-id
HAVING COUNT (*) > 200)
GROUP By school-id

for each school with more than 200 students appearing in exams, the name of the school and the number of 100s scored by its students

for each school with more than 200 students in it, the name of the school and the number of 100s scored by its students

for each school with more than 200 students in it, the name of the school and the number of its students scoring 100 in at least one exam

nothing; the query has a syntax error

Discuss

Answer: (d).nothing; the query has a syntax error

Q32.

Given the basic ER and relational models, which of the following is INCORRECT?

An attribute of an entity can have more than one value

An attribute of an entity can be composite

In a row of a relational table, an attribute can have more than one value

In a row of a relational table, an attribute can have exactly one value or a NULL value

Discuss

Answer: (c).In a row of a relational table, an attribute can have more than one value

Q33.

Consider a join (relation algebra) between relations r(R)and s(S) using the nested loop method. There are 3 buffers each of size equal to disk block size, out of which one buffer is reserved for intermediate results. Assuming size(r(R)) < size(s(S)), the join will have fewer number of disk block accesses if

relation r(R) is in the outer loop

relation s(S) is in the outer loop

join selection factor between r(R) and s(S) is more than 0.5

join selection factor between r(R) and s(S) is less than 0.5

Discuss

Answer: (a).relation r(R) is in the outer loop

Q34.

Let E1 and E2 be two entities in an E/R diagram with simple single-valued attributes. R1 and R2 are two relationships between E1 and E2, where R1 is one-to-many and R2 is many-to-many. R1 and R2 do not have any attributes of their own. What is the minimum number of tables required to represent this situation in the relational model?

Discuss

Answer: (b).3

Q35.

In a schema with attributes A, B, C, D and E following set of functional dependencies are given

A → B A → C CD → E B → D E → A

Which of the following functional dependencies is NOT implied by the above set?

CD → AC

BD → CD

BC → CD

AC → BC

Discuss

Answer: (b).BD → CD

Q36.

A database of research articles in a journal uses the following schema.

(VOLUME, NUMBER, STARTPGE, ENDPAGE, TITLE, YEAR, PRICE)

The primary key is (VOLUME, NUMBER, STARTPAGE, ENDPAGE) and the following functional dependencies exist in the schema.

(VOLUME, NUMBER, STARTPAGE, ENDPAGE) -> TITLE
(VOLUME, NUMBER) -> YEAR
(VOLUME, NUMBER, STARTPAGE, ENDPAGE) -> PRICE

The database is redesigned to use the following schemas.

(VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, PRICE)
(VOLUME, NUMBER, YEAR)

Which is the weakest normal form that the new database satisfies, but the old one does not?

1NF

2NF

3NF

BCNF

Discuss

Answer: (b).2NF

Q37.

Which of the following relational query languages have the same expressive power?

1.Relational algebra
2.Tuple relational calculus restricted to safe expressions
3.Domain relational calculus restricted to safe expressions

II and III only

I and II only

I and III only

I, II and III

Discuss

Answer: (d).I, II and III

Q38.

A Relation R with FD set {A->BC, B->A, A->C, A->D, D->A}. How many candidate keys will be there in R?

Discuss

Answer: (c).3

Q39.

What is the min and max number of tables required to convert an ER diagram with 2 entities and 1 relationship between them with partial participation constraints of both entities?

Min 1 and max 2

Min 1 and max 3

Min 2 and max 3

Min 2 and max 2

Discuss

Answer: (c).Min 2 and max 3

Q40.

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?

Discuss

Answer: (b).4

Page 4 of 11

Welcome to the DBMS MCQs Page

DBMS MCQs | Page 4 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

Web Technologies

Systems Programming

Systems Analysis and Design Methods

Formal Languages and Automata Theory

SQL Server

Software Architecture and Design

JavaScript

PHP

MATLAB