### Multiple Choice Questions and Answers

Question 1 : A situation where a process or a set of processes is blocked, waiting for some resource that is held by some other waiting processes

(a) Mutual Exclusion
(b) Semaphore
(d) None of the above

Question 2 : A resource type, R is represented by 3-dots, it has

(a) 2 instances
(b) 3 instances
(c) 4 instances
(d) 6 instances

Question 3 : Acyclic RAG implies

(c) Starvation
(d) None of the above

Question 4 : A safe state is

(c) Polling state
(d) None of the above

Question 5 : A new process can be started only if Question 6 : RAG stands for

(a) Resource and Graph
(b) Resource Allocation Graph
(c) Resource After Graph
(d) None of the above

Question 7 : A claim edge is represented, usually, by a

(a) Solid line
(b) Thin line
(c) Dashed line
(d) None of the above

Question 8 : For multiple instances of a resource type which algorithm is used

(a) Divide and Conquer algorithm
(b) Banker’s Algorithm
(c) Sorting Algorithm
(d) None of the above

Question 9 : The Need-matrix is given by the formula

(a) Need = Max – Allocation
(b) Need = Max + Allocation
(c) Need = Max * Allocation
(d) None of the above

Question 10 : The safety-algorithm takes

(a) 0 (mn)
(b) 0 (mn2)
(c) 0 (m+n)
(d) None of the above

Question 11 : Another variant of RAG is

(a) Call graph
(b) Wait-for graph
(c) Shortest path graph
(d) None of the above

Question 12 : Banker’s algorithm for resource allocation deals with

(d) None of the above

Question 13 : In Resource Allocation Graph (RAG), circles represent

(a) Processes
(b) Resources
(c) Both ‘a’ and ‘b’
(d) None of the above

Question 14 : A set of resource allocation such that the system can allocate resources to each process in some order and still avoid deadlock is

(a) Unsafe state
(b) Safe state
(c) Starvation
(d) None of the above