In _________________Page Replacement algorithm. If we use the recent past as an approximation of the near future, then we will replace the page that has not been used for the longest period of time.

• A) Low Reset UP (LRU)
• B) Low Resolution Used (LRU)
• C) Least Recently Used (LRU)
• D) Low Reset Used (LRU)

What is calculated by available[i] = maxres[i] - allocation[i] in Baker’s algorithm?

• A) Remaining resources
• B) Average memory usage
• C) Process priority
• D) Total resource usage

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) safe state
• C) stop state
• D) halt state

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

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

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

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

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

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

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

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

Producer process produces an item that is ________by the consumer.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

What is the purpose of the Banker's Algorithm?

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

In _________________Page Replacement algorithm. If we use the recent past as an approximation of the near future, then we will replace the page that has not been used for the longest period of time.

• A) Low Reset UP (LRU)
• B) Least Recently Used (LRU)
• C) Low Reset Used (LRU)
• D) Low Resolution Used (LRU)

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

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

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,k] = j
• B) Need[ j,i ] = k
• C) Need[k,j] = k
• D) Need[i,j] = k

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

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