MCQs – Mutual exclusion algorithms in Parallel and Distributed Computing

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

30
Score: 0
Attempted: 0/30
Subscribe
1. What is the primary goal of mutual exclusion in parallel and distributed systems?



2. Which property is essential for a mutual exclusion algorithm to be correct?



3. What does the term “critical section” refer to in the context of mutual exclusion?



4. Which algorithm is based on the idea of “turns” to achieve mutual exclusion?



5. In Lamport’s bakery algorithm, what does each process take before entering the critical section?



6. Which algorithm uses “flags” and “turns” to achieve mutual exclusion?



7. What is the primary purpose of the “turn” variable in Peterson’s algorithm?



8. In Fischer’s algorithm, how many processes can enter the critical section simultaneously?



9. What is the primary goal of the “test-and-set” instruction in mutual exclusion algorithms?



10. Which algorithm is based on the idea of “flags” and “waiting” to achieve mutual exclusion?



11. What does the term “busy waiting” refer to in the context of mutual exclusion?



12. In Lamport’s bakery algorithm, how are ties resolved between processes with the same ticket number?



13. What is the role of the “interested” array in Fischer’s algorithm?



14. In Peterson’s algorithm, what is the purpose of the “flag” variables?



15. Which algorithm uses a “victim” variable to achieve mutual exclusion?



16. In Fischer’s algorithm, what is the role of the “num” array?



17. What is the primary advantage of Lamport’s bakery algorithm?



18. In Peterson’s algorithm, what is the significance of the “turn” variable?



19. What is the primary disadvantage of busy waiting in mutual exclusion algorithms?



20. In Fischer’s algorithm, what is the purpose of the “turn” variable?



21. Which algorithm is known for its simplicity and avoidance of busy waiting?



22. What is the primary purpose of the “turn” variable in Fischer’s algorithm?



23. In Peterson’s algorithm, how are ties between processes with the same priority resolved?



24. What is the primary focus of Lamport’s bakery algorithm?



25. In Fischer’s algorithm, what is the role of the “choosing” array?



26. What is the primary purpose of the “interested” array in Peterson’s algorithm?



27. In Fischer’s algorithm, how are ties between processes with the same priority resolved?



28. What is the primary disadvantage of busy waiting in mutual exclusion algorithms?



29. In Peterson’s algorithm, what is the role of the “victim” variable?



30. Which algorithm is known for its avoidance of busy waiting and simplicity?



 

Read More MCQs on Parallel and Distributed Computing

  1. Cluster design MCQs
  2. Algorithms in Parallel and Distributed Computing MCQs 
  3. MPI (Message Passing Interface) MCQs
  4. Scalability analysis of parallel systems MCQs
  5. Distributed graph algorithms MCQs
  6. Mutual exclusion algorithms MCQs in parallel computing MCQs
  7. Deadlock and termination detection algorithms MCQs
  8. Leader election algorithms MCQs
  9. Predicate detection algorithms MCQs
  10. Total order and causal order multicast MCQs
  11. Search algorithms and dynamic load balancing for discrete optimization MCQs
  12. Parallel and Distributed Computing MCQs
  13. Parallel Processing MCQs

Homepage for MCQs on Parallel and Distributed Computing

Related Posts:

All Copyrights Reserved 2025 Reserved by T4Tutorials