Distributed Operating System Questions

MCQ

71.

In case of failure, a new transaction coordinator can be elected by ____________

bully algorithm

ring algorithm

both bully and ring algorithm

none of the mentioned

Discussion

MCQ

72.

In distributed systems, election algorithms assumes that ____________

a unique priority number is associated with each active process in system

there is no priority number associated with any process

priority of the processes is not required

none of the mentioned

Discussion

MCQ

73.

According to the ring algorithm, links between processes are ____________

bidirectional

unidirectional

both bidirectional and unidirectional

none of the mentioned

Discussion