Distributed Synchronization MCQ’s

Read Time:1 Minute, 36 Second

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

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

2. 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

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

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

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

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

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

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

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

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

Happy
Happy
0 %
Sad
Sad
0 %
Excited
Excited
0 %
Sleepy
Sleepy
0 %
Angry
Angry
0 %
Surprise
Surprise
0 %

Average Rating

5 Star
0%
4 Star
0%
3 Star
0%
2 Star
0%
1 Star
0%

Leave a Reply

Your email address will not be published. Required fields are marked *

Previous post Distributed Coordination MCQ’s
Next post I/O Subsystem MCQ’s