Advanced Database Management System - Tutorials and Notes: Relational database management systems mcq quiz with answers 18

Search Engine

Please visit, subscribe and share 10 Minutes Lectures in Computer Science

Saturday, 21 November 2020

Relational database management systems mcq quiz with answers 18

MCQ on various aspects in DBMS including database schedules, indexing, data storage, normalization, database views, query optimizers and multivalued dependency questions with answers, RDBMS Multiple Choice Questions with Answers

Database management systems - MCQ exam questions

 

1. Consider a B+ tree of order 100. One of the non-leaf nodes has 95 pointers. How many keys will that node contain?

a) 95

b) 94

c) 100

d) 47

Click here to view answer


 

2. Consider a B+ tree of order 100. One of the leaf nodes has 90 pointers. How many keys will that node contain?

a) 90

b) 100

c) 89

d) 91

Click here to view answer


 

3. Consider a database file that consists of 1000 fixed-length records. The size of each record is 300 bytes. This file has to be stored in disk blocks of size 1024 bytes, with no spanning of records. How many blocks will be needed to store this file?

a) 300

b) 1000

c) 334

d) 332

Click here to view answer


 

4. Which of the following is/are most suitable for the given schedule S1?

Schedule S1 = W1(X), W2(Y), W3(Z), C1, R3(X), C2, R3(Y), C3

Here, W and R represent write and read operations respectively, numbers in the suffix represents the transaction id, letters inside bracket represent data items, and C1, C2, C3 are commit instructions.

a) Conflict-serializable schedule

b) Recoverable schedule

c) Not conflict-serializable schedule

d) Not-recoverable schedule

Click here to view answer


 

5. Which of the following is/are most suitable for the given schedule S2?

Schedule S2 = R1(X), W2(X), W2(Y), C2, R1(Y), C1

a) Conflict-serializable schedule

b) Recoverable schedule

c) Not conflict-serializable schedule

d) Not-recoverable schedule

Click here to view answer


 

************************
Related posts:


Quiz questions with answers on DBMS introduction concepts

How many keys a leaf node can have in a B+ tree in DBMS

How many pointers a non-leaf node can have in a B+ tree in DBMS

what are the properties of B+ tree 

how many disk blocks required to store a database file of fixed size records with no spanning of records

List down all the recoverable and conflict serializable schedules 

No comments:

Post a comment

Featured Content

Multiple choice questions in Natural Language Processing Home

MCQ in Natural Language Processing, Quiz questions with answers in NLP, Top interview questions in NLP with answers Multiple Choice Que...

All time most popular contents