SSC IMD SA Mock 02 – Question 116
Question: In Peterson’s algorithm for mutual exclusion between two processes, which shared variables are used to prevent race conditions? दो
Question: In Peterson’s algorithm for mutual exclusion between two processes, which shared variables are used to prevent race conditions? दो
Question: What is the maximum number of keys that a B-tree of order \(m\) and height \(h\) (where root is
Question: In Dijkstra’s single-source shortest path algorithm implemented with a Min-Heap (Binary Heap), what is the worst-case time complexity for
Question: Which graph traversal algorithm can detect a cycle in a directed graph using three-color marking (White, Gray, Black)? किस
Question: In a 5-stage instruction pipeline (IF, ID, EX, MEM, WB), an instruction produces a result that is immediately needed
Question: What is the minimal boolean expression for the function \(F(A, B, C, D) = \sum m(0, 2, 8, 10,
Question: Belady’s Anomaly (where increasing the number of page frames results in an increase in page faults) can occur in
Question: Which of the following conditions is NOT a necessary condition for a deadlock to occur in an operating system?
Question: A 4-way set-associative cache memory has a total size of 64 KB with a cache block size of 64
Question: A system uses paging with a page size of 4 KB and a 32-bit logical address space. Each page