DSSSB TGT Computer Science Mock 02

Question: Which of the following scheduling algorithms is non-preemptive by default? निम्नलिखित में से कौन-सा शेड्यूलिंग एल्गोरिदम डिफ़ॉल्ट रूप से

Question: What is the size of the Virtual Address space in a 32-bit computer architecture with byte-addressable memory? बाइट-एड्रेसेबल मेमोरी

Question: A relation \(R(A, B)\) has 10 tuples, and relation \(S(B, C)\) has 15 tuples. What is the maximum possible

Question: What is the worst-case time complexity of the Quick Sort algorithm? क्विक सॉर्ट (Quick Sort) एल्गोरिदम की सबसे खराब

Question: In SQL, which constraint ensures that all values in a column are distinct and none of them is NULL?

Question: In an Operating System, the technique of combining multiple non-contiguous free memory fragments into a single large contiguous block

Question: Which of the following problems cannot be solved in polynomial time by a deterministic Turing machine (i.e. is widely

Question: Which disk scheduling algorithm services disk I/O requests by always moving the disk arm towards the nearest cylinder request,

Question: In SQL, what is the effect of an INNER JOIN between two tables that share no matching rows based

Question: Match the SQL command categories in Column A with their commands in Column B: Column A (Category) Column B