The circular wait condition can be prevented by ____________

• A. Defining a linear ordering of resource types
• B. Using thread
• C. Using pipes
• D. All of the mentioned

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

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

A problem encountered in multitasking when a process is perpetually denied necessary resources is called ____________

• A. Deadlock
• B. Starvation
• C. Inversion
• D. Aging

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

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

An un-interruptible unit is known as ____________

• A. Single
• B. Atomic
• C. Static
• D. None of the mentioned

TestAndSet instruction is executed ____________

• A. After a particular process
• B. Periodically
• C. Atomically
• D. None of the mentioned

Semaphore is a/an _______ to solve the critical section problem.

• A. Hardware for a system
• B. Special program for a system
• C. Integer variable
• D. None of the mentioned

What are the two atomic operations permissible on semaphores?

• A. Wait and signal
• B. Stop and wait
• C. Hold and signal
• D. None of the mentioned