Question
Consider three processes P1, P2, P3 with burst times 10, 5, 8 milliseconds respectively. All arrive at time 0. If they are scheduled using the Shortest Job First (SJ
- F non-preemptive algorithm, what is the average waiting time?
More IT Operating System Questions
- Given a table Transactions(txn_id, account_id, amount, txn_date), which query correctly finds accounts that made more than 3 transactions on the same singl...
- What is a characteristic feature of a dense index in a database indexing system?
- Which is connectionless and unreliable protocol
- A process is classified as 'I/O-bound.' Which scheduling characteristic would most directly benefit this type of process and the system's overall responsiv...
- Which of the following metrics is NOT typically used in algorithm analysis?
- Consider the in-order traversal of a Binary Search Tree. What characteristic does the sequence of visited nodes possess?
- Which algorithmic paradigm does the Floyd-Warshall algorithm primarily use?
- Which algorithm is a greedy algorithm used to find the Minimum Spanning Tree (MST) of a graph by repeatedly adding the smallest weight edge that connects t...
- A system uses a 32-bit logical address space and a page size of 4KB. If each page table entry (PTE) is 4 bytes, how many entries can a single-level page ta...
- Consider the following Java code snippet: import java.util.PriorityQueue; public class HeapQuestion1 { public static void main(Strin...
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)