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
Q10: For each critical section (CS) execution, Ricart-Agrawala
Q11: For each critical section (CS) execution, maekawa's
Q12: RAYMOND'S TREE BASED ALGORITHM is an
A)non-
Q13: Suzuki-Kasami's Broadcast Algorithm is an
A)non- token based
Q14: Full form of NTP is:
A)network time protocol
B)new
Q16: Pretransfering also known as
A)premigrating
B)precopying
C)prefiltering
D)postcopying
Q17: change the state of thread from suspe
A)run()
B)yield()
C)destroy()
D)start()
Q18: Distributed syatem consists of set of resour
A)printer
B)processor
C)cd
D)processes
Q19: This is not feature of cooperative algorithm
A)complex
B)larger
Q20: How is access to resources of various
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents