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.
Which of the following is true about the Round Robin (RR) CPU scheduling algorithm?
Which of the following is NOT a characteristic of the Internet of Things (IoT)?
The amortized time for inserting into a dynamic array (like C++ vector) is:
In a binary tree, if the number of leaf nodes is L, what is the number of nodes with two children?
A directed acyclic graph (DAG) has 10 vertices and 15 edges. What is the maximum possible number of topological orderings?
Which algorithm guarantees the shortest path in a graph with negative weights but no negative cycles?
Which sorting algorithm has an average-case time complexity of O(n log n) and is known for its efficiency, often using a divide-and-conquer approach?
Which algorithm guarantees minimum spanning tree and will produce a different tree depending on tie-breaking?
Which of the following is substring of “IXAMBEE”?
Which of the following is considered the strongest type of encryption method in modern cyber security practices?   Â
