Database management system data storage and access MCQ for engineering students

Database management system data storage and access MCQ for engineering students

Database management system data storage and access MCQ for engineering students - TRUE / FALSE questions

1. The second and higher levels must be sparse in an index of multiple levels on sequential files.

TRUE
FALSE

2. Hash index is efficient in answering range queries, such as finding studetns with age between 18 and 21.

TRUE
FALSE

3. The order of insertions into a B+ tree will affect the tree's final structure at the end.

TRUE
FALSE

4. Disk seek time and data transfer time are the only two components needed to access a page on disk.

TRUE
FALSE

5. Dynamic hash tables support range queries.

TRUE
FALSE

6. Query optimization is a major concept that enables declarative SQL queries, because it automatically generates query plans, without having users to write procedural queries.

TRUE
FALSE

7. Pointer swizzling refers to the techniques that convert disk pointers to memory addresses.

TRUE
FALSE

8. For buffer management, a policy like LRU may be inefficient for transaction processing in RDBMS, but it will not affect correctness.

TRUE
FALSE

9. For disk latency, seek time refers to the time for the head to find the desired sector– i.e., for the disk to rotate so the first of the sectors containing the desired data reaches the head.

TRUE
FALSE

10. Seek time is part of the disk latency time.

TRUE
FALSE

Go to TRUE/FALSE general quizzes page

Go to DBMS MCQ for Engineering Students home page

Score =

Correct answers:

dbms quiz entity relationship model quiz disk storage and access in dbms quiz database management systems mcq for interviews define rotational latency, seek time, data transfer time data accessibility in dbms quiz DBMS mcq with answers for university students