Virtual Labs

What is the primary purpose of Banker’s Algorithm?

a: Memory allocation Explanation

Explanation

b: Deadlock avoidance in resource allocation Explanation

Explanation

c: Process scheduling Explanation

Explanation

d: Page replacement Explanation

Explanation

Who developed Banker’s Algorithm?

a: Alan Turing Explanation

Explanation

b: Edsger Dijkstra Explanation

Explanation

c: Donald Knuth Explanation

Explanation

d: John von Neumann Explanation

Explanation

What type of algorithm is Banker’s Algorithm?

a: Deadlock avoidance algorithm Explanation

Explanation

b: Deadlock detection algorithm Explanation

Explanation

c: Memory management algorithm Explanation

Explanation

d: CPU scheduling algorithm Explanation

Explanation

What does the term 'safe state' mean in Banker’s Algorithm?

a: A state where processes will always enter deadlock Explanation

Explanation

b: A state where at least one sequence of process execution avoids deadlock Explanation

Explanation

c: A state where all processes run simultaneously Explanation

Explanation

d: A state where no resources are allocated Explanation

Explanation

What is required to implement Banker’s Algorithm?

a: Priority scheduling Explanation

Explanation

b: A known maximum resource demand for each process Explanation

Explanation

c: A real-time operating system Explanation

Explanation

d: A multiprocessor system Explanation

Explanation

Which of the following is NOT a component of Banker’s Algorithm?

a: Allocation matrix Explanation

Explanation

b: Need matrix Explanation

Explanation

c: Available resources matrix Explanation

Explanation

d: Cache memory Explanation

Explanation

What happens if a process requests resources exceeding its declared maximum need?

a: The request is granted Explanation

Explanation

b: The process is terminated Explanation

Explanation

c: The request is denied Explanation

Explanation

d: The system goes into deadlock Explanation

Explanation

What happens if there are not enough available resources to fulfill a request?

a: The process is allocated whatever is available Explanation

Explanation

b: The request is placed on hold until resources are available Explanation

Explanation

c: The process is terminated Explanation

Explanation

d: The system enters a deadlock Explanation

Explanation

In which scenario is Banker’s Algorithm most useful?

a: Single-user systems Explanation

Explanation

b: Multi-user, multi-process systems with dynamic resource allocation Explanation

Explanation

c: Real-time systems Explanation

Explanation

d: Systems with fixed resource allocation Explanation

Explanation

What is the biggest limitation of Banker’s Algorithm?

a: It does not prevent deadlocks Explanation

Explanation

b: It requires knowledge of maximum resource needs in advance Explanation

Explanation

c: It cannot allocate resources dynamically Explanation

Explanation

d: It requires infinite resources Explanation

Explanation

Banker's Algorithm