Deadlock and termination detection algorithms MCQs – Parallel and Distributed Computing

14
Score: 0
Attempted: 0/14

1. : What is the primary goal of termination detection algorithms?
(A) Detecting and recovering from deadlocks
(B) Preventing deadlocks
(C) Detecting when a distributed computation has completed
(D) Maximizing hardware diversity

2. : Which algorithm is commonly used for global termination detection in a distributed system?
(A) Two-Phase Commit
(B) Chandy-Misra-Hass
(C) Vector-Clock algorithm
(D) Lamport’s bakery algorithm

3. : In termination detection, what does the “Marker” represent in the Chandy-Misra-Hass algorithm?
(A) A process that has completed its execution
(B) A process that is waiting for a resource
(C) A process that is part of a deadlock
(D) A process that has sent termination messages to all other processes

4. : Which algorithm is known for its use of “snapshots” for termination detection?
(A) Chandy-Misra-Hass algorithm
(B) Vector-Clock algorithm
(C) Two-Phase Commit
(D) Banker’s algorithm

5. : What is the primary focus of the “Snapshot” algorithm in termination detection?
(A) Detecting and recovering from deadlocks
(B) Minimizing fault tolerance
(C) Capturing the global state of a distributed system
(D) Efficient load balancing

6. : In termination detection, what is the purpose of the “Termination Message”?
(A) A message indicating the presence of a deadlock
(B) A message indicating that a process has completed its execution
(C) A message requesting additional resources
(D) A message indicating the start of a distributed computation

7. : Which algorithm is commonly used for local termination detection in a distributed system?
(A) Chandy-Misra-Hass algorithm
(B) Vector-Clock algorithm
(C) Two-Phase Commit
(D) Snapshot algorithm

8. : What is the significance of the “Snapshot” in the Snapshot algorithm for termination detection?
(A) Capturing the global state of a distributed system
(B) Detecting and recovering from deadlocks
(C) Minimizing fault tolerance
(D) Efficient load balancing

9. : In termination detection, what does the “Flush” operation do in the Chandy-Misra-Hass algorithm?
(A) Flushes out deadlock processes
(B) Flushes out terminated processes
(C) Flushes out all messages in the system
(D) Flushes out processes waiting for a resource

10. : What is the primary advantage of using a “Termination Message” in termination detection?
(A) Efficient load balancing
(B) Minimizing fault tolerance
(C) Detecting when a process enters the critical section
(D) Identifying when a process has completed its execution

11. : Which algorithm is commonly used for distributed termination detection based on marking processes?
(A) Chandy-Misra-Hass algorithm
(B) Vector-Clock algorithm
(C) Two-Phase Commit
(D) Snapshot algorithm

12. : In termination detection, what is the purpose of the “Marker” in the Chandy-Misra-Hass algorithm?
(A) A process that has completed its execution
(B) A process that is waiting for a resource
(C) A process that is part of a deadlock
(D) A process that has sent termination messages to all other processes

13. : Which algorithm is known for its use of “Termination Points” for distributed termination detection?
(A) Chandy-Misra-Hass algorithm
(B) Vector-Clock algorithm
(C) Two-Phase Commit
(D) Snapshot algorithm

14. : What is the primary purpose of the “Termination Message” in termination detection?
(A) A message indicating the presence of a deadlock
(B) A message indicating that a process has completed its execution
(C) A message requesting additional resources
(D) A message indicating the start of a distributed computation

Deadlock and termination detection algorithms MCQs – Parallel and Distributed Computing
By: Prof. Dr. Fazal Rehman | Last updated: May 6, 2025

Read More MCQs on Parallel and Distributed Computing

Homepage for MCQs on Parallel and Distributed Computing

Related Posts: