Question
Which of the following sorting algorithms has the best worst-case time complexity of O(n log
Which of the following sorting algorithms has the best worst-case time complexity of O(n log
n)?
More IT Operating System Questions
- What is the output of the following C code using #define? #include #define SQUARE(x) x*x int main() { int a = SQUARE(2+3); printf("%d", a);...
- What is 'virtual memory' in the context of operating systems?
- In a sliding window protocol with a window size of 4, using Go-Back-N ARQ, if frame 3 (out of frames 0-7, using 3-bit sequence numbers) is lost during tran...
- A queue initially empty undergoes the following sequence of operations: 1. enqueue(10) 2. enqueue(20) 3. dequeue() 4. enqueue(30) 5. dequeue() 6...
- What is a "final" class in Java?
- The following C++ code has a compilation error. How can you correct it to properly use the abstract base class `Printer`? #include class Printer { ...
- A C function attempts to copy a substring. #include #include #include char* copy_substring(const char* source, int start_index, int length) { char...
- Router is responsible for packet forwarding, including routing. Router works at which layer?
- Which CPU scheduling algorithm can cause 'starvation', where longer processes may wait indefinitely because shorter processes are continually given priorit...
- Complete the Java code to replace all occurrences of a specific word (case-insensitive) in a string. public class RegexReplacer { public String rep...
Hey! Ask a query
Please enter email id
The email must be a valid email address.
Please enter Mobile Number
Please enter valid Mobile Number
Please enter your Doubt
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
- 200 Questions with Detailed Solutions
- Section-wise Coverage (GA, English, Quant & Reasoning)