Pdc Quiz 3

10 Questions | Total Attempts: 3103

SettingsSettingsSettings
Please wait...
Mathematics Quizzes & Trivia

Questions and Answers
  • 1. 
    The ring election algorithm works by:
    • A. 

      Having all nodes in a ring of processors send a message to a coordinator who will elect the leader.

    • B. 

      Sending a token around a set of nodes. Whoever has the token is the coordinator.

    • C. 

      Sending a message around all available nodes and choosing the first one on the resultant list.

    • D. 

      Building a list of all live nodes and choosing the largest numbered node in the list.

  • 2. 
    Which event is concurrent with the vector clock (2, 8, 4)?
    • A. 

      (3, 9, 5)

    • B. 

      (3, 8, 4)

    • C. 

      (1, 7, 3)

    • D. 

      (4, 8, 2)

  • 3. 
    The Ricart & Agrawala distributed mutual exclusion algorithm is
    • A. 

      More efficient and more fault tolerant than a centralized algorithm.

    • B. 

      Less efficient and less fault tolerant than a centralized algorithm

    • C. 

      Less efficient but more fault tolerant than a centralized algorithm.

    • D. 

      More efficient but less fault tolerant than a centralized algorithm.

  • 4. 
    Event a has a Lamport timestamp of 4. Event b has a Lamport timestamp of 8. What can we tell about events a and b ?
    • A. 

      Events a and b are causally related.

    • B. 

      Events a and b are concurrent

    • C. 

      If events a and b are causally related, then event a happened before event b .

    • D. 

      Event a happened before event b .

  • 5. 
    A bully election algorithm:
    • A. 

      picks the process with the largest ID.

    • B. 

      Picks the first process to respond to an election request.

    • C. 

      Relies on majority vote to pick the winning process.

    • D. 

      Assigns the role of coordinator to the processs holding the token at the time of election.

  • 6. 
    Which set of events is concurrent ( all events are concurrent with each other)?
    • A. 

      (3, 1, 5, 7), (3, 2, 6, 7), (2, 1, 6, 8)

    • B. 

      (2, 1, 3, 4), (2, 2, 3, 3), (3, 3, 2, 5)

    • C. 

      (1, 2, 3, 4), (2, 3, 4, 5), (3, 4, 5, 6)

    • D. 

      (1, 5, 6, 7), (1, 4, 5, 7), (1, 3, 2, 2)

  • 7. 
    Which mutual exclusion algorithm is useful when the membership of the group is unknown?
    • A. 

      Centralized

    • B. 

      Lamport’s.

    • C. 

      Token ring

    • D. 

      All of the above.

  • 8. 
    In the token passing approach of distributed systems, processes are organized in a ring structure
    • A. 

      Logically

    • B. 

      Physically

    • C. 

      Both logically and physically

    • D. 

      None of the mentioned

  • 9. 
    In distributed systems, a logical clock is associated with
    • A. 

      Each instruction

    • B. 

      Each process

    • C. 

      each register

    • D. 

      None of the mentioned

  • 10. 
    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 mentioned

Back to Top Back to top