Database Management System (DBMS) MCQs with answers Page - 73

Here, you will find a collection of MCQ questions on Database Management System (DBMS). Go through these questions to enhance your preparation for upcoming examinations and interviews.

To check the correct answer, simply click the View Answer button provided for each question.

Have your own questions to contribute? Click the button below to share your MCQs with others!

+ Add Question

A

Admin • 833.24K Points
Coach

Q. A block that is not allowed to be written back to disk is said to be

  • (A) pinned
  • (B) forced
  • (C) buffer
  • (D) all of the mentioned

A

Admin • 833.24K Points
Coach

Q. In case the buffer manager do not write the blocks properly then the buffer manager uses

  • (A) replacement strategy
  • (B) forced strategy
  • (C) crash recovery system
  • (D) both replacement and forced strategy

A

Admin • 833.24K Points
Coach

Q. The technique where the blocks which have been used are replaced is called

  • (A) replacement strategy
  • (B) forced strategy
  • (C) crash recovery system
  • (D) most recently used

A

Admin • 833.24K Points
Coach

Q. frees the space occupied by a block as soon as the final tuple of that block has been processed.

  • (A) replacement strategy
  • (B) forced strategy
  • (C) toss immediate strategy
  • (D) most recently used

A

Admin • 833.24K Points
Coach

Q. Indices whose search key specifies an order different from the sequential order of the file are called indices.

  • (A) nonclustered
  • (B) secondary
  • (C) all of the mentioned
  • (D) none of the mentioned

A

Admin • 833.24K Points
Coach

Q. An consists of a search-key value and pointers to one or more records with that value as their search-key value.

  • (A) index entry
  • (B) index hash
  • (C) index cluster
  • (D) index map

A

Admin • 833.24K Points
Coach

Q. In a clustering index, the index record contains the search-key value and a pointer to the first data record with that search-key value and the rest of the records will be in the sequential pointers.

  • (A) dense
  • (B) sparse
  • (C) straight
  • (D) continuous

A

Admin • 833.24K Points
Coach

Q. In a index, an index entry appears for only some of the search-key values.

  • (A) dense
  • (B) sparse
  • (C) straight
  • (D) continuous

A

Admin • 833.24K Points
Coach

Q. A search key containing more than one attribute is referred to as a search key.

  • (A) simple
  • (B) composite
  • (C) compound
  • (D) secondary

A

Admin • 833.24K Points
Coach

Q. In B+ tree the node which points to another node is called

  • (A) leaf node
  • (B) external node
  • (C) final node
  • (D) internal node

Add MCQ in this Category

If you want to share an MCQ question in this category, it's a great idea! It will be helpful for many other students using this website.

Share Your MCQ

Browse Categories

Click on category to learn MCQs of that category.