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

Related Posts 👇

  • Scheduling is done so as to?

    (A) Keep the waiting time the same
    (B) Increase the waiting time
    (C) Decrease the waiting time
    (D) None of the above

Leave a Reply

Your email address will not be published. Required fields are marked *

error: Content is protected !!