1. Which one of the following is the deadlock avoidance algorithm?
a) banker’s algorithm
b) round-robin algorithm
c) elevator algorithm
d) karn’s algorithm
Explanation: Banker’s algorithm
2. What is the drawback of banker’s algorithm?
a) in advance processes rarely know how much resource they will need
b) the number of processes changes as time progresses
c) resource once available can disappear
d) all of the mentioned
Explanation: all of the mentioned
3. For an effective operating system, when to check for deadlock?
a) every time a resource request is made
b) at fixed time intervals
c) every time a resource request is made at fixed time intervals
d) none of the mentioned
Explanation: every time a resource request is made at fixed time intervals
4. A problem encountered in multitasking when a process is perpetually denied necessary resources is called ____________
a) deadlock
b) starvation
c) inversion
d) aging
Explanation: A problem encountered in multitasking when a process is perpetually denied necessary resources is called starvation
5. Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence?
a) resource allocation graph
b) starvation graph
c) inversion graph
d) none of the mentioned
Explanation: Resource allocation graph
6. To avoid deadlock ____________
a) there must be a fixed number of resources to allocate
b) resource allocation must be done only once
c) all deadlocked processes must be aborted
d) inversion technique can be used
Explanation: To avoid deadlock there must be a fixed number of resources to allocate
7. The number of resources requested by a process ____________
a) must always be less than the total number of resources available in the system
b) must always be equal to the total number of resources available in the system
c) must not exceed the total number of resources available in the system
d) must exceed the total number of resources available in the system
Explanation: The number of resources requested by a process must not exceed the total number of resources available in the system
8. The request and release of resources are ___________
a) command line statements
b) interrupts
c) system calls
d) special programs
Explanation: The request and release of resources are system calls
9. What are Multithreaded programs?
a) lesser prone to deadlocks
b) more prone to deadlocks
c) not at all prone to deadlocks
d) none of the mentioned
Explanation: Multiple threads can compete for shared resources.
10. For a deadlock to arise, which of the following conditions must hold simultaneously?
a) Mutual exclusion
b) No preemption
c) Hold and wait
d) all of the mentioned
Explanation: all of the mentioned