a) banker’s algorithm b) round-robin algorithm c) elevator algorithm d) karn’s algorithm Answer: a Explanation: Banker’s algorithm

a) defining a linear ordering of resource types b) using thread c) using pipes d) all of the mentioned

a) the system can allocate resources to each process in some order and still avoid a deadlock

a) mutual exclusion b) a process may hold allocated resources while awaiting assignment of other resources

a) that can be used by one process at a time and is not depleted by that ...

Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock? I) 2-phase locking

a) A transaction may obtain locks, but does not release any b) A transaction may obtain locks, and ...

a) A transaction may obtain locks, but does not release any b) A transaction may obtain locks, and ...

a) growing & shrinking phase b) shrinking & creation phase c) creation & growing phase d) destruction & creation phase Answer: ...

a) governs how locks are acquired b) governs how locks are released c) governs how locks are acquired and released d) none ...