Question
Three processes arrive as follows: P1 (arrival=0, burst=8), P2 (arrival=1, burst=4), P3 (arrival=2, burst=2). Using Shortest Remaining Time First (SRTF, preemptive) scheduling, what is the turnaround time of P1?
More IT Operating System Questions
- What is the worst-case time complexity of the Bubble Sort algorithm?
- A DP solution for LCS is producing incorrect lengths. Upon inspection, the dp table is being filled, but the values don't match expected outcomes. Which of...
- In a Selection Sort algorithm, the inner loop finds the index of the minimum element in the unsorted part. Which line correctly completes the if condition ...
- Which statement is FALSE regarding DRAM memory?
- A deadlock-prevention scheme forces a process to release all currently held resources before requesting new ones, and it can only proceed once it acquires ...
- Consider the following C code snippet designed to calculate the sum of digits of a non-negative integer: #include int sumDigits(int n) { ...
- A system uses paging with a page size of 4 KB and a logical address space of 32 bits. How many bits are needed for the page offset, and how many entries wo...
- The following Java code attempts to demonstrate method overloading, but it has a compilation error. How should it be corrected? public class Calculator ...
- In Oracle SQL, which operator is used to return rows from the first query that do not appear in the second query (equivalent to set difference)?
- Abstraction in OOP primarily focuses on:
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)