Deadlock can be described more precisely in term of a directed graph called
a) Bar graph
b) system resource allocation graph
c) pie charts
d) Line graph
Is it possible to have a deadlock involving only one single process?
a) yes
b) no
c) not sure
d) none of these
What did the method of handling deadlocks?
a) Use a protocol
b) Allow the system to enter a deadlock state
c) Ignore deadlock
d) all of these
A Banker’s algorithm is used to….
a) To rectify deadlock
b) to detect deadlock
c) to prevent deadlock
d) to solve deadlock
What is dispatch latency?
a) Time taken by the dispatcher
b) The time taken by the processor
c) The whole time taken by all processor
d) None of these
A page fault occurs when…………
a) the deadlock happens
b) the segmentation starts
c) the page is found in the memory
d) the page is not found in the memory
