Solved

Which Mutual Exclusion Algorithm Is Useful When the Membership of the Group

Question 15

Multiple Choice

Which mutual exclusion algorithm is useful when the membership of the group is unknown?


A) centralized
B) lamport's.
C) token ring
D) decentralized algorithm

Correct Answer:

verifed

Verified

Unlock this answer now
Get Access to more Verified Answers free of charge

Related Questions

Q10: Full form of NTP is:<br>A)network time protocol<br>B)new

Q11: How is access to resources of various

Q12: Distributed syatem consists of set of resour<br>A)printer<br>B)processor<br>C)cd<br>D)processes

Q13: This is not feature of cooperative algorithm<br>A)complex<br>B)larger

Q14: RAYMOND'S TREE BASED ALGORITHM is an        <br>A)non-

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

Q20: Which algorithm requires "1 to ?" messages