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.
Output of below code
public class Prg {
public static void main(String args[]){
System.out.print("A" + "B" + 'A');
}
...The Master Theorem gives time complexity for recurrences of the form:
Which of the following is true for the time complexity of binary search?
Which is not true about minimum spanning tree?
Which sorting algorithm divides the array into halves recursively?
Which command is TCL command
Which of the following is substring of “IXAMBEE”?
Which data structure is used in BFS (Breadth-First Search)?
Which of the following is considered the strongest type of encryption method in modern cyber security practices?   Â
In a binary search tree (BST), what is true about the left child of a node?