SSC IMD SA Mock 02 – Question 123
Question: What is the worst-case time complexity of QuickSort when the pivot element is always chosen as the median of
Question: What is the worst-case time complexity of QuickSort when the pivot element is always chosen as the median of
Question: Which of the following problems is known to be undecidable? निम्नलिखित में से कौन सी समस्या अनिर्धार्य (Undecidable) मानी
Question: Which of the following properties is guaranteed by a strict Binary Search Tree (BST) after performing an In-Order traversal?
Question: In a multi-threaded program, what condition occurs when multiple threads concurrently access shared data without synchronization and at least
Question: How many 3-to-8 line decoders with an enable input are required to construct a 5-to-32 line decoder without additional
Question: In a microprocessor, which addressing mode specifies the operand as part of the instruction itself? माइक्रोप्रोसेसर में कौन सा
Question: What does the following C declaration mean: int (*func[5])(float, char);? निम्नलिखित C घोषणा का क्या अर्थ है: int (*func[5])(float,
Question: Which of the following disk scheduling algorithms is susceptible to starvation of requests situated far away from the current
Question: Which graph traversal algorithm can detect a cycle in a directed graph using three-color marking (White, Gray, Black)? किस
Question: In Dijkstra’s single-source shortest path algorithm implemented with a Min-Heap (Binary Heap), what is the worst-case time complexity for