Operating System Questions & Answers – Distributed Synchronization

This set of Operating System Multiple Choice Questions & Answers (MCQs) focuses on “Distributed Synchronization”.

1. In distributed systems, a logical clock is associated with ______________
a) each instruction
b) each process
c) each register
d) none of the mentioned
View Answer

Answer: b
Explanation: None.

2. If timestamps of two events are same, then the events are ____________
a) concurrent
b) non-concurrent
c) monotonic
d) non-monotonic
View Answer

Answer: a
Explanation: None.

3. 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
View Answer

Answer: b
Explanation: None.
advertisement
advertisement

4. 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
View Answer

Answer: c
Explanation: None.

5. 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
View Answer

Answer: c
Explanation: None.
Note: Join free Sanfoundry classes at Telegram or Youtube

6. 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
View Answer

Answer: a
Explanation: None.

7. 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
View Answer

Answer: d
Explanation: None.
advertisement

8. 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
View Answer

Answer: c
Explanation: None.

9. In distributed systems, election algorithms assumes that ____________
a) a unique priority number is associated with each active process in system
b) there is no priority number associated with any process
c) priority of the processes is not required
d) none of the mentioned
View Answer

Answer: a
Explanation: None.
advertisement

10. According to the ring algorithm, links between processes are ____________
a) bidirectional
b) unidirectional
c) both bidirectional and unidirectional
d) none of the mentioned
View Answer

Answer: b
Explanation: None.

Sanfoundry Global Education & Learning Series – Operating System.

If you find a mistake in question / option / answer, kindly take a screenshot and email to [email protected]

advertisement
advertisement
Subscribe to our Newsletters (Subject-wise). Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with latest contests, videos, internships and jobs!

Youtube | Telegram | LinkedIn | Instagram | Facebook | Twitter | Pinterest
Manish Bhojasia - Founder & CTO at Sanfoundry
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He lives in Bangalore, and focuses on development of Linux Kernel, SAN Technologies, Advanced C, Data Structures & Alogrithms. Stay connected with him at LinkedIn.

Subscribe to his free Masterclasses at Youtube & discussions at Telegram SanfoundryClasses.