Multiple Granularity MCQ

Test your knowledge with important Multiple Granularity MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Multiple Granularity MCQs at Bissoy

• This validation scheme is called the _________ scheme since transactions execute optimistically, assuming they will be able to finish execution and validate at the end.
  ক

  Validation protocol

  খ

  Validation-based protocol

  গ

  Timestamp protocol

  ঘ

  Optimistic concurrency-control
• The __________ requires that each transaction Ti executes in two or three different phases in its lifetime, depending on whether it is a read-only or an update transaction.
  ক

  Validation protocol

  খ

  Validation-based protocol

  গ

  Timestamp protocol

  ঘ

  Timestamp-ordering protocol
• The _____________ ensures that any conflicting read and write operations are executed in timestamp order.
  ক

  Timestamp-ordering protocol

  খ

  Timestamp protocol

  গ

  W-timestamp

  ঘ

  R-timestamp
• ____________ denotes the largest timestamp of any transaction that executed write(Q) successfully.
  ক

  W-timestamp(Q)

  খ

  R-timestamp(Q)

  গ

  RW-timestamp(Q)

  ঘ

  WR-timestamp(Q)
• If a node is locked in ______________ the subtree rooted by that node is locked explicitly in shared mode, and that explicit locking is being done at a lower level with exclusive-mode locks.
  ক

  Intention lock modes

  খ

  shared and intention-exclusive (SIX) mode

  গ

  Intention-exclusive (IX) mode

  ঘ

  Intention-shared (IS) mode
• If a node is locked in ____________ then explicit locking is being done at a lower level, with exclusive-mode or shared-mode locks.
  ক

  Intention lock modes

  খ

  Intention-shared-exclusive mode

  গ

  Intention-exclusive (IX) mode

  ঘ

  Intention-shared (IS) mode
• If a node is locked in __________ explicit locking is being done at a lower level of the tree, but with only shared-mode locks.
  ক

  Intention lock modes

  খ

  Intention-shared-exclusive mode

  গ

  Intention-exclusive (IX) mode

  ঘ

  Intention-shared (IS) mode
• If a node is locked in an intention mode, explicit locking is done at a lower level of the tree. This is called
  ক

  Intention lock modes

  খ

  Explicit lock

  গ

  Implicit lock

  ঘ

  Exclusive lock
• In a database the file is contained in ________
  ক

  Entire database

  খ

  Two area

  গ

  One area

  ঘ

  more than one area
• In a granularity hierarchy the highest level represents the
  ক

  Entire database

  খ

  Area

  গ

  File

  ঘ

  Record