Q. Which of the following disadvantages follows the single coordinator approach?

  • (A) bottleneck
  • (B) slow response
  • (C) deadlock
  • (D) one request per second
πŸ’¬ Discuss
βœ… Correct Answer: (A) bottleneck

Q. What are the parts of a global unique identifier?

  • (A) local unique timestamp
  • (B) remote timestamp
  • (C) clock number
  • (D) all of the mentioned
πŸ’¬ Discuss
βœ… Correct Answer: (A) local unique timestamp

Q. In distributed systems, a logical clock is associated with ______________

  • (A) each instruction
  • (B) each process
  • (C) each register
  • (D) none of the mentioned
πŸ’¬ Discuss
βœ… Correct Answer: (B) each process

Q. If timestamps of two events are same, then the events are ____________

  • (A) concurrent
  • (B) non-concurrent
  • (C) monotonic
  • (D) non-monotonic
πŸ’¬ Discuss
βœ… Correct Answer: (A) concurrent

Q. If a process is executing in its critical section ____________

  • (A) any other process can also execute in its critical section
  • (B) no other process can execute in its critical section
  • (C) one more process can execute in its critical section
  • (D) none of the mentioned
πŸ’¬ Discuss
βœ… Correct Answer: (B) no other process can execute in its critical section

Q. 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
πŸ’¬ Discuss
βœ… Correct Answer: (C) when it receives a reply message from all other processes in the system

Q. For proper synchronization in distributed systems ____________

  • (A) prevention from the deadlock is must
  • (B) prevention from the starvation is must
  • (C) prevention from the deadlock & starvation is must
  • (D) none of the mentioned
πŸ’¬ Discuss
βœ… Correct Answer: (C) prevention from the deadlock & starvation is must

Q. 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
πŸ’¬ Discuss
βœ… Correct Answer: (A) logically

Q. In distributed systems, what will the transaction coordinator do?

  • (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 mentioned
πŸ’¬ Discuss
βœ… Correct Answer: (D) all of the mentioned

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

  • (A) bully algorithm
  • (B) ring algorithm
  • (C) both bully and ring algorithm
  • (D) none of the mentioned
πŸ’¬ Discuss
βœ… Correct Answer: (C) both bully and ring algorithm

Jump to