πŸ“Š Distributed Computing System (DCS)
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
πŸ“Š Distributed Computing System (DCS)
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
πŸ“Š Distributed Computing System (DCS)
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
πŸ“Š Distributed Computing System (DCS)
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
πŸ“Š Distributed Computing System (DCS)
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
πŸ“Š Distributed Computing System (DCS)
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
πŸ“Š Distributed Computing System (DCS)
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