Distributed Computing System MCQ Questions And Answers

Approved & Edited by ProProfs Editorial Team
The editorial team at ProProfs Quizzes consists of a select group of subject experts, trivia writers, and quiz masters who have authored over 10,000 quizzes taken by more than 100 million users. This team includes our in-house seasoned quiz moderators and subject matter experts. Our editorial experts, spread across the world, are rigorously trained using our comprehensive guidelines to ensure that you receive the highest quality quizzes.
Learn about Our Editorial Process
| By DrGhanshyam
D
DrGhanshyam
Community Contributor
Quizzes Created: 1 | Total Attempts: 6,035
Questions: 10 | Attempts: 6,036

SettingsSettingsSettings
Distributed Computing System MCQ Questions And Answers - Quiz

Do you know what a distributed computing system is? If yes, play this quiz and give correct answers to these MCQ questions asked here. A distributed computer system is a branch of computer science that is characterized by multiple software components connected to multiple computers that run as a single system. These computers are either connected by a LAN or a WAN. Do you have studied the same topic earlier? Give this quiz a shot and check how sharp your memory is. Good luck!


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.

    Correct Answer
    D. Building a list of all live nodes and choosing the largest numbered node in the list.
    Explanation
    The ring election algorithm works by building a list of all live nodes and choosing the largest numbered node in the list. This means that each node in the ring sends a message to all other nodes to determine their availability. Then, the node with the highest number (assuming the nodes are numbered) is elected as the leader or coordinator. This approach ensures that the node with the highest number, which usually represents the highest priority, becomes the leader.

    Rate this question:

  • 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)

    Correct Answer
    D. (4, 8, 2)
    Explanation
    The event (4, 8, 2) is concurrent with the vector clock (2, 8, 4) because all three components of the vector clock are less than or equal to the corresponding components of the event's vector clock. In other words, the event (4, 8, 2) could have happened at the same time or after the event represented by the vector clock (2, 8, 4).

    Rate this question:

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

    Correct Answer
    B. Less efficient and less fault tolerant than a centralized algorithm
    Explanation
    The Ricart & Agrawala distributed mutual exclusion algorithm is less efficient and less fault tolerant than a centralized algorithm. This is because in a distributed algorithm, multiple processes need to communicate and coordinate with each other to achieve mutual exclusion, which introduces overhead and can lead to delays. Additionally, in a distributed system, there is a higher probability of failures and network partitions, which can further impact the algorithm's fault tolerance compared to a centralized algorithm.

    Rate this question:

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

    Correct Answer
    C. If events a and b are causally related, then event a happened before event b .
    Explanation
    Based on the given information, we can conclude that events a and b are causally related. This is because event b has a higher Lamport timestamp than event a, indicating that event b occurred after event a. Therefore, we can infer that event a happened before event b.

    Rate this question:

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

    Correct Answer
    A. picks the process with the largest ID.
    Explanation
    A bully election algorithm picks the process with the largest ID as the coordinator. This means that in a system where multiple processes are competing to become the coordinator, the process with the highest ID is considered the most powerful and capable of handling the coordination responsibilities. By selecting the process with the largest ID, the algorithm ensures that the coordinator role is assigned to the most capable process in terms of its ID value.

    Rate this question:

  • 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)

    Correct Answer
    B. (2, 1, 3, 4), (2, 2, 3, 3), (3, 3, 2, 5)
  • 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.

    Correct Answer
    A. Centralized
    Explanation
    The centralized mutual exclusion algorithm is useful when the membership of the group is unknown because it allows for a single central entity to control access to a shared resource. In this algorithm, all requests for access to the resource are sent to the central entity, which then grants access to one request at a time. This approach is effective in situations where the group membership is unknown because it does not require knowledge of the other participants in the group.

    Rate this question:

  • 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

    Correct Answer
    A. Logically
    Explanation
    In the token passing approach of distributed systems, processes are organized in a ring structure logically. This means that the processes are connected in a circular manner, where each process has a direct connection to its neighboring processes. The logical ring structure allows for the orderly passing of a token, which is used to control access to shared resources. Each process in the ring takes turns holding the token and can only access the shared resource when it possesses the token. This logical organization ensures that the token is passed in a predetermined order, preventing conflicts and ensuring fairness in resource allocation.

    Rate this question:

  • 9. 

    In distributed systems, a logical clock is associated with

    • A.

      Each instruction

    • B.

      Each process

    • C.

      each register

    • D.

      None of the mentioned

    Correct Answer
    B. Each process
    Explanation
    In distributed systems, a logical clock is associated with each process. This is because in a distributed system, multiple processes are running concurrently and independently. Each process needs to have its own logical clock to maintain a consistent order of events and ensure synchronization among the processes. The logical clock helps in determining the relative ordering of events across different processes, even if there is no global clock available in the system. Therefore, associating a logical clock with each process is necessary in distributed systems.

    Rate this question:

  • 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

    Correct Answer
    C. When it receives a reply message from all other processes in the system
    Explanation
    In a distributed system, a process enters its critical section when it receives a reply message from all other processes in the system. This ensures that all other processes have completed their critical sections and are ready to proceed. By waiting for all processes to reply, it guarantees that there is no concurrent access to shared resources, preventing any conflicts or inconsistencies. This synchronization mechanism ensures the correct and orderly execution of critical sections in a distributed system.

    Rate this question:

Related Topics

Back to Top Back to top
Advertisement
×

Wait!
Here's an interesting quiz for you.

We have other quizzes matching your interest.