SSC IMD SA Mock 02 – Question 113
Question: What is the maximum number of keys that a B-tree of order \(m\) and height \(h\) (where root is
Question: What is the maximum number of keys that a B-tree of order \(m\) and height \(h\) (where root is
Question: In Peterson’s algorithm for mutual exclusion between two processes, which shared variables are used to prevent race conditions? दो
Question: In a Red-Black Tree, what is the maximum possible height of a tree with \(n\) internal nodes? एक रेड-ब्लैक
Question: Which sorting algorithm has the best worst-case number of comparisons among comparison-based sorting algorithms, asymptotically achieving \(n \log_2 n
Question: What is the Effective Memory Access Time (EMAT) if cache access time is 2 ns, main memory access time
Question: A 4-way set-associative cache memory has a total size of 64 KB with a cache block size of 64
Question: Which of the following conditions is NOT a necessary condition for a deadlock to occur in an operating system?
Question: Belady’s Anomaly (where increasing the number of page frames results in an increase in page faults) can occur in
Question: What is the minimal boolean expression for the function \(F(A, B, C, D) = \sum m(0, 2, 8, 10,
Question: In a 5-stage instruction pipeline (IF, ID, EX, MEM, WB), an instruction produces a result that is immediately needed