Multiple Choice
Which algorithm requires "1 to ?" messages to enter and leave a critical region?
A) token ring algorithm
B) centralized algorithm
C) decentralized algorithm
D) distributed algorithm
Correct Answer:

Verified
Correct Answer:
Verified
Q15: Which mutual exclusion algorithm is useful when
Q16: For each critical section (CS) execution, Ricart-Agrawala
Q17: For each critical section (CS) execution, maekawa's
Q18: Pretransfering also known as<br>A)premigrating<br>B)precopying<br>C)prefiltering<br>D)postcopying
Q19: When the process issues an I/O request<br>A)it
Q21: What are the characteristics of process migr<br>A)transfer
Q22: change the state of thread from suspe<br>A)run()<br>B)yield()<br>C)destroy()<br>D)start()
Q23: Which event is concurrent with the vector
Q24: Which of the following is an example
Q25: Absolute time synchronization can be achieved using<br>A)vector