Operating System MCQ and Answers – Distributed Synchronization

These Operating System MCQ and Answers – Distributed Synchronization are asked in various examinations including BCA, MCA, GATE, and other tests. The questions based on the below Operating System MCQ and Answers – Distributed Synchronization test your basic knowledge of MCQs on the topic of Operating Systems and the level of comprehension and grasp that you hold.

Operating System MCQ and Answers – Distributed Synchronization

1. In distributed systems, what will the transaction coordinator do?

a) starts the execution of the transaction

b) breaks the transaction into a number of sub-transactions

c) coordinates the termination of the transaction

d) all of the mentioned

Answer: d

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

Answer: c

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

Answer: a

4. According to the ring algorithm, links between processes are ____________

a) bidirectional

b) unidirectional

c) both bidirectional and unidirectional

d) none of the mentioned

Answer: b

5. In distributed systems, a logical clock is associated with ______________

a) each instruction

b) each process

c) each register

d) none of the mentioned

Answer: b

6. If timestamps of two events are same, then the events are ____________

a) concurrent

b) non-concurrent

c) monotonic

d) non-monotonic

Answer: a

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

Answer: b

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

Answer: c

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

Answer: c

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

Answer: a

Comments