Question
Which of the following algorithms is most commonly used
in Operating Systems for deadlock prevention?Solution
Correct Option: Banker's Algorithm (A) is used in operating systems to prevent deadlocks by determining if a system can safely allocate resources to avoid deadlock situations. It ensures that processes proceed without circular waiting, a condition for deadlock. Why Other Options Are Wrong: B) Round Robin Scheduling: This is a CPU scheduling algorithm used for time-sharing systems, not for deadlock prevention. It deals with process scheduling, not resource allocation. C) First-Come, First-Served Scheduling: This is a simple scheduling algorithm where processes are executed in the order of arrival. It has no role in preventing deadlocks. D) Shortest Job Next: This is another CPU scheduling algorithm used to prioritize tasks based on their shortest execution time, which doesn’t address deadlocks. E) Least Recently Used (LRU): LRU is a page replacement algorithm in memory management, unrelated to deadlock handling.
?% of (168 ÷ 8 × 20) = 126
25% of 140 + 2 × 8 = ? + 9 × 5
- What will come in place of (?), in the given expression.
(56 × 3) + (480 ÷ 6) = ? 641.5 + 72 × 8 = ? × 4
Simplify-
x + 3(y + x – 2) – (x + y).
What will come in the place of question mark (?) in the given expression?
412 + 25% of 2400 = ? + 1131
[∛(3375/19683 )- ∛(125/1728 ) ] ÷ ∛(64/729) = ? - 3/8
8 × 12 + 110 ÷ 5 = 72 + ?
28 × 3.5 +25 × 3.2 = ? - 62
[∛(91125/19683 )- ∛(3375/5832 ) ] × ∛(512/9261) = ? - √(484/3969)