In distributed systems, election algorithms assumes that
A. a unique priority number is associated with each active process in system
B. there is no priority number associated with any process
C. priority of the processes is not required
D. none of the mentioned
Answer:A
In distributed systems, election algorithms assumes that
A. a unique priority number is associated with each active process in system B. there is no priority number associated with any process C. priority of the processes is not required D. none of the mentioned
Explanation:None.