Bissoy.com
Doctors Medicines MCQs Q&A

State true or false: Locking and timestamp ordering force a wait or rollback whenever a conflict is detected.

State true or false: Locking and timestamp ordering force a wait or rollback whenever a conflict is detected. Correct Answer True

Locking and timestamp ordering force a wait or rollback whenever a conflict is detected. This property is called pessimism of locking and timestamp protocols.

Related Questions

Consider the following two statements about database transaction schedules: I. Strict two-phase locking protocol generates conflict serializable schedules that are also recoverable. II. Timestamp-ordering concurrency control protocol with Thomas’ Write Rule can generate view serializable schedules that are not conflict serializable. Which of the above statements is/are TRUE?
Which of the following statements is/are true/false regarding modes of Conflict Management Styles?
1. The avoidance modes of conflict management aim at avoiding or postponing conflicts.
2. The compromise mode involves coercion and is likely to fail to reach a solution.
3. The main objective of the defusion mode of conflict resolution is to buy time for dealing with a conflict.
4. Withdrawal is a form of approach mode that involves getting away from a conflict situation.
Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock? I) 2-phase locking II) Timestamp ordering
Consider the following solution to the producer-consumer synchronization problem. The shared buffer size is ?. Three semaphores empty, full and mutex are defined with respective initial values of 0, ? and 1. Semaphore empty denotes the number of available slots in the buffer, for the consumer to read from. Semaphore denotes the number of available slots in the buffer, for the producer to write to. The placeholder variables, denoted by P, Q, R, and S, in the code below can be assigned either empty or full. The valid semaphore operations are: wait ( ) and signal ( ). Producer: Consumer: do {         wait (P) ;         wait (mutex) ;         //Add item to buffer         signal (mutex) ;         signal (Q) ; } while (1) ; do {          wait (R) ;          wait (mutex) ;          //Consume item from buffer          signal (mutex) ;          signal (S) ; } while (1) ;   Which one of the following assignments to P, Q, R and S will yield the correct solution?
Consider the following threads, T1, T2, and T3 executing on a single processor, synchronized using three binary semaphore variables, S1, S2, and S3, operated upon using standard wait() and signal(). The threads can be context switched in any order and at any time. T1 T2 T3 While(true) { Wait(S3); Print(“C”); Signal (S2); } While(true) { Wait(S1); Print(“B”); Signal (S3); } While(true) { Wait(S2); Print(“A”); Signal (S1); }   Which initialization of the semaphores would print the sequence BCABCABCA….?
In timestamp ordering protocol, suppose that the transaction Ti issues read(Q) and TS(Ti)
In timestamp ordering protocol, suppose that the transaction Ti issues write(Q) and TS(Ti)
This question comprises 3 sentences - A, B and C each of which comprises a sentence using the word WAIT. Identify the sentences where the word has been correctly used and mark that combination (A) Wait your options before investing (B) How long must we wait? (C) The longer we wait time the less is the chance of recovery
Whenever you have a hardware resource conflict, it will more likely be an IRQ conflict rather than an i/o conflict because:
State true or false: The Thomas write rule has a greater potential concurrency than the timestamp ordering protocol