Producer-Consumer problem is considered as the process __________ problem.

• A) synchronization
• B) blocking
• C) limitation
• D) receiving

In dining philosopher problem all the five philosophers sitting around the round circular table have _______ chopsticks.

• A) 4
• B) 5
• C) 10
• D) 3

In case producer process wants to produce some item and buffer is already full to its capacity then there will be buffer________message.

• A) full
• B) busy
• C) empty
• D) pull

In ____________a process must enter the maximum number of instances that he may need in the future.

• A) Lotus algorithm
• B) Banker algorithm
• C) College algorithm
• D) University algorithm

In dining philosopher problem all the five philosophers can do two things ______________.

• A) thinking and eating
• B) sleeping and eating
• C) laughing and eating
• D) playing and eating

We have to implement the Producer-Consumer problem by using ______.

• A) Read-Only Memory (ROM)
• B) Programmable Read-Only Memory (PROM)
• C) Shared Memory
• D) Unshared Memory

In Banker algorithm Need data structure is used. If_______, then process Pi may need k more instances of resource type Rj to complete the task.

• A) Need[i,j] = k
• B) Need[k,j] = k
• C) Need[ j,i ] = k
• D) Need[i,k] = j

Producer process produces an item that is ________by the consumer.

• A) send
• B) blocked
• C) hold
• D) consumed

The Solution of Dining Philosopher Problem is used to avoid __________.

• A) Separation condition
• B) Multitasking condition
• C) Deadlock condition
• D) Isolation condition

Dining Philosopher Problem is used in Operating System to solve the Process ________.

• A) Synchronization Problem
• B) Subtracting Problem
• C) Adding Problem
• D) Finding Problem

We need the following data structures in the Banker’s algorithm:

• A) Available, Max, Allocation and Need.
• B) Available, Min, Allocation and Find.
• C) Available, Max, Allocation and Next.
• D) Available, Min, Allocation and First.

In Banker’s algorithm the order of process termination is called__________________.

• A) priority check
• B) safe sequence
• C) random sequence
• D) bulk execution

In case producer process has not yet produced any item and consumer process want to consume an item from the buffer than there will be buffer _______ message.

• A) full
• B) busy
• C) empty
• D) lock

In Banker's Algorithm, the system must know the ________ resource demand of each process in advance.

• A) current
• B) maximum
• C) minimum
• D) average

What is the purpose of the Banker's Algorithm?

• A) Speeding up memory access
• B) Compressing resources
• C) Avoiding deadlock
• D) Managing user passwords

In Banker's algorithm we can say that a system is in a ______if all of the processes in the system can be executed to termination in some order.

• A) reverse state
• B) stop state
• C) halt state
• D) safe state

A system is said to be in a safe state if _____________________.

• A) no process is blocked
• B) resources are never allocated
• C) processes can finish in some order
• D) CPU is idle

In dining philosopher problem, a philosopher can start eating once he has ______chopsticks

• A) 5
• B) 4
• C) 2
• D) 3

In Banker algorithm Max data structure is used. If______, then process Pi can request maximum k instances of resource type Rj.

• A) Max[i,j] = k
• B) Max[ j,i ] = k
• C) Max[k,j] = i
• D) Max[i,k] = j

Which variable is used to check if the system is in a safe state in Banker’s algorithm?

• A) counter
• B) safe
• C) allocation
• D) exec