Q.1
Which of the following cannot be used to implement a timestamp
  • a) System clock
  • b) Logical counter
  • c) External time counter
  • d) None of the mentioned
Q.2
A logical counter is _________ after a new timestamp has been assigned
  • a) Incremented
  • b) Decremented
  • c) Doubled
  • d) Remains the same
Q.3
W-timestamp(Q) denotes?
  • a) The largest timestamp of any transaction that can execute write(Q) successfully
  • b) The largest timestamp of any transaction that can execute read(Q) successfully
  • c) The smallest timestamp of any transaction that can execute write(Q) successfully
  • d) The smallest timestamp of any transaction that can execute read(Q) successfully
Q.4
R-timestamp(Q) denotes?
  • a) The largest timestamp of any transaction that can execute write(Q) successfully
  • b) The largest timestamp of any transaction that can execute read(Q) successfully
  • c) The smallest timestamp of any transaction that can execute write(Q) successfully
  • d) The smallest timestamp of any transaction that can execute read(Q) successfully
Q.5
A ________ ensures that any conflicting read and write operations are executed in timestamp order
  • a) Organizational protocol
  • b) Timestamp ordering protocol
  • c) Timestamp execution protocol
  • d) 802-11 protocol
Q.6
The default timestamp ordering protocol generates schedules that are
  • a) Recoverable
  • b) Non-recoverable
  • c) Starving
  • d) None of the mentioned
Q.7
State true or false: The Thomas write rule has a greater potential concurrency than the timestamp ordering protocol
  • a) True
  • b) False
Q.8
Which of the following timestamp based protocols generates serializable schedules?
  • a) Thomas write rule
  • b) Timestamp ordering protocol
  • c) Validation protocol
  • d) None of the mentioned
Q.9
In timestamp ordering protocol, suppose that the transaction Ti issues read(Q) and TS(Ti)<W-timestamp(Q), then
  • a) Read operation is executed
  • b) Read operation is rejected
  • c) Write operation is executed
  • d) Write operation is rejected
Q.10
In timestamp ordering protocol, suppose that the transaction Ti issues write(Q) and TS(Ti)<W-timestamp(Q), then
  • a) Read operation is executed
  • b) Read operation is rejected
  • c) Write operation is executed
  • d) Write operation is rejected
0 h : 0 m : 1 s