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

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

Q31.
Drop Table cannot be used to drop a Table referenced by ________________ constraint.

(a) Primary key (b) Sub key (c) Super key (d) Foreign key
Discuss
Answer: (c).(d)
Q32.
Database applications were built directly on top of file system to overcome the following drawbacks of using file systems.
(a) Data redundancy and inconsistency
(b) Difficulty in accessing Data
(c) Data isolation
(d) Integrity problems
Discuss
Answer: (d).(a), (b), (c) and (d)
Q33.
For a weak entity set to be meaningful, it must be associated with another entity set in combination with some of their attribute values, is called as :
Discuss
Answer: (c).Owner entity set
Discuss
Answer: (d).Tuples in a weak entity set are not partitioned according to their relationship with tuples in a strong entity set
Q35.
Let E1 and E2 be two entities in E-R diagram with simple single valued attributes. R1 and R2 are two relationships between E1 and E2 where R1 is one - many and R2 is many - many. R1 and R2 do not have any attribute of their own. How many minimum number of tables are required to represent this situation in the Relational Model?

a.

4

b.

3

c.

2

d.

1

Discuss
Answer: (b).3
Q36.
The STUDENT information in a university stored in the relation STUDENT (Name, SEX, Marks, DEPT_Name)
Consider the following SQL Query SELECT DEPT_Name from STUDENT where SEX = 'M' group by DEPT_Name having avg (Marks)>SELECT avg (Marks) from STUDENT. It returns the Name of the Department for which:
Discuss
Answer: (b).The average marks of male students is more than the average marks of students in the University
Discuss
Answer: (b).Lossless preserving decomposition into BCNF is always possible
Discuss
Answer: (a).Non_key attribute V_name is dependent on V_no which is part of composite key
Q39.
The relation schemas R1 and R2 form a Lossless join decomposition of R if and only if :

(a)          R1⌒ R2 ⇒ (R1- R2)

(b)          R1→ R2

(c)          R1⌒ R2 ⇒ (R1- R2)

(d)         R2→ R1⌒R2
Discuss
Answer: (c).(a) and (c) happens
Q40.
In the indexed scheme of blocks to a file, the maximum possible size of the file depends on :
Discuss
Answer: (a).The number of blocks used for index and the size of index
Page 4 of 23

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!