Question
Processes P1(BT=5), P2(BT=3), P3(BT=1), all arriving at time 0, are scheduled with Round Robin, quantum=2. What is the average waiting time?
More IT Operating System Questions
- Consider the following statement regarding Kelvin Double Bridge. Statement (1): It is used for measuring resistance in the range of few ohms to several me...
- Huffman Coding uses a greedy approach to achieve what?
- Three processes have CPU bursts P1=8 ms, P2=4 ms, P3=2 ms and all arrive at time 0. Under non-preemptive SJF, what is the average waiting time?
- Which of the following is a key characteristic of a heap's structure?
- What does the Hamming distance measure in the context of information theory and coding?
- What is the primary function of the 'grep' command in Linux/Unix?
- A single-line comment starts with
- In Python, which of the following built-in data structures can be most efficiently used to implement a stack, and why?
- Which of the following conditions is not one of the four necessary conditions for a deadlock to occur?
- What is the primary benefit of polymorphism?
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)