DSSSB TGT CS Mock 03 – Question 133
Question: What is the time complexity of finding the strongly connected components (SCC) of a directed graph using Tarjan’s algorithm?
Question: What is the time complexity of finding the strongly connected components (SCC) of a directed graph using Tarjan’s algorithm?
Question: In an operating system, what is ‘Thrashing’ primarily caused by? ऑपरेटिंग सिस्टम में ‘थ्रैशिंग’ (Thrashing) मुख्य रूप से किसके
Question: How many flip-flops are required to construct a synchronous MOD-12 counter? एक सिंक्रोनस MOD-12 काउंटर बनाने के लिए कितने
Question: Which CPU scheduling algorithm gives the minimum average waiting time for a given set of stationary processes? स्थिर प्रक्रियाओं
Question: In a multi-threaded program, what condition occurs when multiple threads concurrently access shared data without synchronization and at least
Question: In a paging system, the page size is 2 KB. If a process requires 95,000 bytes of memory, how
Question: Which of the following problems is known to be undecidable? निम्नलिखित में से कौन सी समस्या अनिर्धार्य (Undecidable) मानी
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: What does the following C declaration mean: int (*func[5])(float, char);? निम्नलिखित C घोषणा का क्या अर्थ है: int (*func[5])(float,
Question: Which of the following properties is guaranteed by a strict Binary Search Tree (BST) after performing an In-Order traversal?