Consider the following statements regarding the handling of deadlocks in an operating system: Statement 1: Deadlock avoidance algorithms, such as the Banker's Algorithm, require the system to know the maximum resource demand of processes in advance. Statement 2: Deadlock prevention methods function by imposing rigid restrictions on resource requests but do not require prior knowledge of maximum resource demands.

Question

Computer Science · Deadlock Handling

Verified Solution4 OptionsUpdated: October 2026👁️1 View

Share:

Correct answer

Both statements are true

Save this question and verified answer as a clean study sheet with live clickable link.

👥

Challenge your peer aspirants on WhatsApp or Telegram to solve this question!

Online Test Series

Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.

Chapter Practice

Want more practice questions on Deadlock Handling?

Solve complete topic-wise tests with detailed solutions on GkGet.

Recommended practice questions in Computer Science · Deadlock Handling

Which movement aimed to promote Khadi, a hand-spun and handwoven cloth native to India?

Who were prominent leaders associated with the initial phase of the Telangana Rebellion (1946-1951) against the Nizam's rule and feudal landlords?

What was the immediate trigger for the Revolt of 1857?

Answer 1

Statement 1 is true, but Statement 2 is false

Answer 2

Both statements are false

Answer 3

Both statements are true

Answer 4

Statement 1 is false, but Statement 2 is true

Related Practice Questions