Operating system questions answers distributed synchronization

DOWNLOAD FREE PDF <<CLICK HERE>>

Operating system questions answers distributed synchronization

Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
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
Question 2 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
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
Question 3 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
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
Question 4 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
If timestamps of two events are same, then the events are .....
A
concurrent
B
non-concurrent
C
monotonic
D
non-monotonic
Question 5 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
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
There are 5 questions to complete.

DOWNLOAD FREE PDF <<CLICK HERE>>