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 UGC CBSE NET 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 UGC CBSE NET 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 UGC CBSE NET 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 23

Explore more Topics under UGC CBSE NET Exam

01

Networking

02

Operating System

03

Software Engineering

04

Systems Programming

05

Data Structures and Algorithms

06

Computer Architecture

07

Computer Graphics

08

Artificial Intelligence

09

Web Technologies

10

Theory of Computation(TOC)

11

Discrete Structures

12

Computer Arithmetic

13

Programming in C

14

UNIX System

15

Current Trends and Technologies

16

Neural Networks

17

Fuzzy Systems

Q51.

Consider the following two commands C1 and C2 on the relation R from an SQL database:
C1: drop table R;
C2: delete from R;
Which of the following statements is TRUE?
I. Both C1 and C2 delete the schema for R.
II. C2 retains relation R, but deletes all tuples in R.
III. C1 deletes not only all tuples of R, but also the schema for R.

I only

I and II only

II and III only

I, II and III

Discuss

Answer: (c).II and III only

Q52.

Consider the following database table having A, B, C and D as its four attributes and four possible candidate keys (I, II, III and IV) for this table:
A B C D
a1 b1 c1 d1
a2 b3 c3 d1
a1 b2 c1 d2

I: {B} II: {B, C} III: {A, D} IV: {C, D}
If different symbols stand for different values in the table (e.g., d1 is definitely not equal to d2), then which of the above could not be the candidate key for the database table?

I and III only

III and IV only

II only

I only

Discuss

Answer: (c).II only

Q53.

An attribute A of datatype varchar(20) has value 'Ram' and the attribute B of datatype char(20) has value 'Sita' in oracle. The attribute A has .......... memory spaces and B has .......... memory spaces.

20, 20

3, 20

3, 4

20, 4

Discuss

Answer: (b).3, 20

Q54.

Integrity constraints ensure that changes made to the database by authorized users do not result into loss of data consistency. Which of the following statement(s) is (are) true w.r.t. the examples of integrity constraints?

(A) An instructor Id. No. cannot be null, provided Instructor Id. No. being primary key.
(B) No two citizens have same Adhar-Id.
(C) Budget of a company must be zero.

(A), (B) and (C) are true

(A) false, (B) and (C) are true

(A) and (B) are true; (C) false

(A), (B) and (C) are false

Discuss

Answer: (c).(A) and (B) are true; (C) false

Q55.

Let M and N be two entities in an E-R diagram with simple single valued attributes. R1 and R2 are two relationships between M and N, whereas
R1 is one-to-many and R2 is many-to-many.
The minimum number of tables required to represent M, N, R1 and R2 in the relational model are ..........

Discuss

Answer: (d).3

Q56.

Consider a schema R(MNPQ) and functional dependencies M→N, P→Q. Then the decomposition of R into R1(MN) and R2(PQ) is _______

Dependency preserving but not lossless join

Dependency preserving and lossless join

Lossless join but not dependency preserving

Neither dependency preserving nor lossless join

Discuss

Answer: (a).Dependency preserving but not lossless join

Q57.

If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n?m, the expected number of collisions involving a particular key x is less than ...................

1/n

1/m

n/m

Discuss

Answer: (a).1

Q58.

Which one is correct w.r.t. RDBMS?

primary key ⊆ super key ⊆ candidate key

primary key ⊆ candidate key ⊆ super key

super key ⊆ candidate key ⊆ primary key

super key ⊆ primary key ⊆ candidate key

Discuss

Answer: (b).primary key ⊆ candidate key ⊆ super key

Q59.

Let pk(R) denotes primary key of relation R. A many-to-one relationship that exists between two relations R1 and R2 can be expressed as follows:

pk(R2)→pk(R1)

pk(R1)→pk(R2)

pk(R2)→R1∩R2

pk(R1)→R1∩R2

Discuss

Answer: (b).pk(R1)→pk(R2)

Q60.

For a database relation R(A,B,C,D) where the domains of A,B,C and D include only atomic values, only the following functional dependencies and those that can be inferred from them are:
A→C
B→D
The relation R is in ................

First normal form but not in second normal form

Both in first normal form as well as in second normal form

Second normal form but not in third normal form

Both in second normal form as well as in third normal form

Discuss

Answer: (a).First normal form but not in second normal form

Page 6 of 23

Welcome to the DBMS MCQs Page

DBMS MCQs | Page 6 of 23

Explore more Topics under UGC CBSE NET Exam

Networking

Operating System

Software Engineering

Systems Programming

Data Structures and Algorithms

Computer Architecture

Computer Graphics

Artificial Intelligence

Web Technologies

Theory of Computation(TOC)

Discrete Structures

Computer Arithmetic

Programming in C

UNIX System

Current Trends and Technologies

Neural Networks

Fuzzy Systems

Suggested Topics

Software Engineering

Compiler Design

Data Structures and Algorithms

Cloud Computing

UNIX

Systems Programming

Hadoop

HTML

Visual Basic