Predicate detection algorithms MCQs

By: Prof. Dr. Fazal Rehman | Last updated: May 6, 2025

1. What is the primary goal of predicate detection algorithms in distributed systems?
(A) Minimizing fault tolerance
(B) Efficient load balancing
(C) Detecting and identifying specific events or conditions
(D) Achieving leader election

2. In predicate detection, what does the term “predicate” refer to?
(A) A condition or event that needs to be detected
(B) A process with the highest fault tolerance
(C) A message sent between processes
(D) The elected coordinator in a distributed system

3. Which algorithm is commonly used for predicate detection based on vector timestamps?
(A) Lamport’s algorithm
(B) Chandy-Misra-Hass algorithm
(C) Vector-Clock algorithm
(D) Bully algorithm

4. What is the primary focus of predicate detection algorithms based on vector timestamps?
(A) Detecting specific events or conditions in a distributed system
(B) Efficient load balancing
(C) Minimizing fault tolerance
(D) Leader election

5. In a vector timestamp, what does each component represent?
(A) The process ID
(B) The time at which an event occurred in each process
(C) The priority of a process
(D) The coordinator in a distributed system

6. Which algorithm is known for its use of a “snapshot” to detect a specific global state?
(A) Chandy-Lamport algorithm
(B) Vector-Clock algorithm
(C) Two-Phase Commit
(D) Tree-Based algorithm

7. What is the primary advantage of predicate detection algorithms based on vector timestamps?
(A) Simplicity and ease of implementation
(B) Minimizing fault tolerance
(C) Handling dynamic changes in the system
(D) Efficient load balancing

8. In a distributed system, what is the role of the “initiator” in predicate detection?
(A) The process with the highest fault tolerance
(B) The process responsible for deadlock detection
(C) The process initiating the detection of a specific predicate
(D) The elected leader or head of the group

9. Which algorithm is commonly used for predicate detection based on the “happened-before” relation?
(A) Lamport’s algorithm
(B) Chandy-Misra-Hass algorithm
(C) Vector-Clock algorithm
(D) Tree-Based algorithm

10. What is the primary focus of predicate detection algorithms based on the “happened-before” relation?
(A) Detecting specific events or conditions in a distributed system
(B) Efficient load balancing
(C) Minimizing fault tolerance
(D) Leader election

11. In predicate detection based on the “happened-before” relation, what does the relation capture?
(A) The order of processes entering the critical section
(B) The order of events in a distributed system
(C) The priority of a process
(D) The coordination between processes

12. Which algorithm uses the concept of “cut” to identify a specific point in the execution of a distributed system?
(A) Chandy-Lamport algorithm
(B) Vector-Clock algorithm
(C) Two-Phase Commit
(D) Snapshot algorithm

13. In a distributed system, what does the term “cut” represent in the Chandy-Lamport algorithm?
(A) A specific point in the execution where events are recorded
(B) The process with the highest fault tolerance
(C) The priority of a process
(D) The coordinator in a distributed system

14. What is the primary disadvantage of predicate detection algorithms based on the “happened-before” relation?
(A) Simplicity and ease of implementation
(B) Inefficient load balancing
(C) Handling dynamic changes in the system
(D) High communication overhead

15. Which algorithm is known for its ability to detect specific global states using “cut” messages?
(A) Chandy-Lamport algorithm
(B) Vector-Clock algorithm
(C) Two-Phase Commit
(D) Tree-Based algorithm

16. In predicate detection based on the “happened-before” relation, what is the purpose of the “cut” messages?
(A) Identifying specific predicates in a distributed system
(B) Creating a global snapshot of the system’s state
(C) Minimizing fault tolerance
(D) Efficient load balancing

17. Which algorithm uses a global snapshot to detect specific predicates in a distributed system?
(A) Chandy-Lamport algorithm
(B) Vector-Clock algorithm
(C) Two-Phase Commit
(D) Bully algorithm

18. What is the primary focus of predicate detection algorithms based on global snapshots?
(A) Detecting specific events or conditions in a distributed system
(B) Efficient load balancing
(C) Minimizing fault tolerance
(D) Leader election

19. In a distributed system, what does the term “global snapshot” represent in predicate detection?
(A) A specific point in the execution where events are recorded
(B) The process with the highest fault tolerance
(C) The coordinator in a distributed system
(D) A consistent and simultaneous snapshot of the system’s state

20. Which algorithm is known for its use of “anti-messages” to compensate for missed messages in a global snapshot?
(A) Chandy-Lamport algorithm
(B) Vector-Clock algorithm
(C) Two-Phase Commit
(D) Tree-Based algorithm

21. In predicate detection based on global snapshots, what is the purpose of “anti-messages”?
(A) Identifying specific predicates in a distributed system
(B) Compensating for missed messages during the snapshot process
(C) Minimizing fault tolerance
(D) Efficient load balancing

22. Which algorithm uses the concept of “consistent global states” for predicate detection?
(A) Chandy-Lamport algorithm
(B) Vector-Clock algorithm
(C) Consistent-Global algorithm
(D) Tree-Based algorithm

23. What is the primary advantage of predicate detection algorithms based on consistent global states?
(A) Simplicity and ease of implementation
(B) Handling dynamic changes in the system
(C) Minimizing fault tolerance
(D) Efficient load balancing

24. In a distributed system, what does the term “consistent global state” represent in predicate detection?
(A) A specific point in the execution where events are recorded
(B) A state where all processes agree on a specific predicate
(C) The coordinator in a distributed system
(D) The process with the highest fault tolerance

25. Which algorithm uses the concept of “consistent cuts” for predicate detection?
(A) Chandy-Lamport algorithm
(B) Vector-Clock algorithm
(C) Consistent-Cut algorithm
(D) Tree-Based algorithm

26. What is the primary focus of predicate detection algorithms based on “consistent cuts”?
(A) Detecting specific events or conditions in a distributed system
(B) Efficient load balancing
(C) Minimizing fault tolerance
(D) Achieving leader election

27. In predicate detection based on “consistent cuts,” what does the term “cut” represent?
(A) A specific point in the execution where events are recorded
(B) A state where all processes agree on a specific predicate
(C) The coordinator in a distributed system
(D) A consistent partition of events

28. Which algorithm uses the concept of “consistent global snapshots” for predicate detection?
(A) Chandy-Lamport algorithm
(B) Vector-Clock algorithm
(C) Consistent-Snapshot algorithm
(D) Tree-Based algorithm

29. What is the primary disadvantage of predicate detection algorithms based on “consistent global snapshots”?
(A) Simplicity and ease of implementation
(B) Inefficient load balancing
(C) Handling dynamic changes in the system
(D) High communication overhead

30. In predicate detection based on “consistent global snapshots,” what is the purpose of the “consistent snapshot”?
(A) Identifying specific predicates in a distributed system
(B) Creating a state where all processes agree on a specific predicate
(C) Minimizing fault tolerance
(D) Efficient load balancing