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

Q41.
Consider the following relational schemas for a library database: 
Book (Title, Author, Catalog_no, Publisher, Year, Price) 
Collection (Title, Author, with the following dependencies :

I. Title, Author —> Catalog_no
II. Catalog_no —> Title, Author, Publisher, Year
III. Publisher, Title, Year —> Price
Assume (Author, Title) is the key for both schemas. Which one of the following is true ?
Discuss
Answer: (c).Book is in 2NF and Collection in 3NF
Discuss
Answer: (b).An entity type can participate as a subclass in more than one specialization
Q43.

Match the following with respect to the jump statements

List-I List-II

a. Timeout ordering protocol i. Wait for graph

b. Deadlock prevention ii. Roll back

c. Deadlock detection iii. Wait-die scheme

d. Deadlock recovery iv. Thomas Write Rule

Codes:
a b c d
Discuss
Answer: (a).iv       iii       i       ii
Q44.
Consider the schema

R = {S,T, U,V}

and the dependencies

S →T, T → U, U → V and V → S

If   R   =   (R1  and   R2)   be   a decomposition such that R1 ∩ R2 = Ф

then the decomposition is
Discuss
Answer: (d).in both 2NF and 3NF
Q45.
Which of the following concurrency protocol ensures both conflict serializability deadlock:
I. 2-phase locking 
II. Time phase ordering 
Discuss
Answer: (b).II only
Q46.
The "part-whole", or "a-part-of", relationship in which objects representing the components of something associated with an object representing the entire assembly is called as
Discuss
Answer: (b).Aggregation
Q47.
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 K is
Discuss
Answer: (a).less than 1
Q48.
In RDBMS, the constraint that no key attribute (column) may be NULL is referred to as:
Discuss
Answer: (c).Entity Integrity
Q49.
Which of the following statement(s) is/are FALSE in the context of Relational DBMS ? I. Views in a database system are important because they help with access control by allowing users to see only a particular subset of the data in the database. II. E-R diagrams are useful to logically model concepts. III. An update anomaly is when it is not possible to store information unless some other, unrelated information is stored as well. IV. SQL is a procedural language.
Discuss
Answer: (b).III and IV only
Discuss
Answer: (a).To allow duplicate tuples in the table by filling the primary key column(s) with NULL
Page 5 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!