(A) Deadlock Avoidance Scheme
(B) Deadlock Prevention Scheme
(C) Deadlock Recovery Scheme
(D) Both A & B
Author:
Deadlocks can be described more precisely in terms of a directed graph called a?
(A) System Resource Allocation Graph
(B) Bar graph
(C) Pie graph
(D) Line graph
A process must be holding at least one resource and waiting to acquire additional resources that are currently being held by other processes. This condition for deadlock is referred to as?
(A) No preemption
(B) Circular wait
(C) Mutual exclusion
(D) Hold and wait
All deadlocks involve connecting needs for?
(A) Users
(B) Computers
(C) Programs
(D) Resources
With deadlock detection requested resources are granted to?
(A) Users
(B) Processes
(C) Resources
(D) Programs
No preemption means that a resource is released as?
(A) Voluntarily
(B) Non voluntarily
(C) Terminated
(D) None of the above
A deadlock situation can arise if which of the following conditions hold simultaneously in a system?
(A) No Preemption
(B) Hold and Wait
(C) Mutual exclusion
(D) All of the above
Which escape sequence is used for new line?
(A) \n
(B) \a
(C) \t
(D) None of the above