DS QUIZ MODEL-Unit-1-III CSE A

_____ are used to identify deadlocks in a distributed system.

• wait-for-graphs
• linear graphs
• undirected graphs
• none

______ algorithm is used for detecting deadlocks.

• Edge Chasing
• Vector set
• Vertex set
• none

Voting is not used in Quorum consensus method

• true
• false

Edge chasing algorithm is performed in three stages

• true
• false

_____ deadlocks are not really deadlocks

• Phantom
• Created
• Private
• none

In distributed systems, a logical clock is associated with ______________

• each instruction
• each process
• each register
• none of the mentioned

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

• concurrent
• non-concurrent
• monotonic
• non-monotonic

If a process is executing in its critical section ____________

• any other process can also execute in its critical section
• no other process can execute in its critical section
•  one more process can execute in its critical section
• none of the mentioned

A process can enter into its critical section ____________

• anytime
• when it receives a reply message from its parent process
• when it receives a reply message from all other processes in the system
• none of the mentioned

For proper synchronization in distributed systems ____________

• prevention from the deadlock is must
• prevention from the starvation is must
• prevention from the deadlock & starvation is must
• none of the mentioned