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 above

In distributed systems transaction coordinator:

(A) Starts the execution of transaction
(B) Breaks the transaction into number of sub transactions
(C) Coordinates the termination of the transaction
(D) All of the above

A process can enter into its critical section:

(A) Anytime
(B) When it receives a reply message from its parent process
(C) When it receives a reply message from all other processes in the system
(D) None of the above

error: Content is protected !!