Testbook Logo
Exams SuperCoaching Test Series Skill Academy
More

Question

Download Solution PDF

Comprehension

Consider the following set of processes with the arrival time and length of CPU burst time given in milli secends (ms)
Process Arrival Time Burst Time
P1 0 5
P2 2 3
P3 2 2
P4 5 3
P5 6 1

Calculate the average response time for these processes with a nonpreemptive priority Scheduling algorithm? Priority of the process are as follows and consider that all the processes came at zero (0) time. (Note low numbers represent high priority).

Process Arrival Time Burst Time
P1 5 3
P2 3 1
P3 2 5
P4 3 4
P5 1 2

  1. 5.8 ms
  2. 5.2 ms
  3. 4.7 ms
  4. 3.8 ms

Answer (Detailed Solution Below)

Option 1 : 5.8 ms

Detailed Solution

Download Solution PDF

Scheduling Algorithm: Non-preemptive Priority Scheduling (Low number = High Priority)

Gantt chart:

P5

P3

P2

P4

P1

0    2    7    8    12    15

Process Table:

Process Priority Arrival Time (AT) Burst Time (BT) Start Time (ST) Completion Time (CT) Response Time (RT)
P1 5 0 3 12 15 12
P2 3 0 1 7 8 7
P3 2 0 5 2 7 2
P4 3 0 4 8 12 8
P5 1 0 2 0 2 0

Average response time = ​​​​​\(\frac{{12 + 7 + 2 + 8 + 0}}{5} = 5.8\) ms

Answer: The corrected average response time is 5.8 ms.

Note: The Priority column is essential to justify the scheduling order. The correct formula for response time is Response Time = Start Time − Arrival Time.

Download Solution PDF
‹‹ Previous Ques
Next Ques ››

More Process Scheduling Questions

Q1.Which of the following is a benefit of scheduling emails?
Q2.Calculate the average response time for these processes with a nonpreemptive priority Scheduling algorithm? Priority of the process are as follows and consider that all the processes came at zero (0) time. (Note low numbers represent high priority). Process Arrival Time Burst Time P1 5 3 P2 3 1 P3 2 5 P4 3 4 P5 1 2
Q3.When we apply Shortest Job First (SJF) scheduling Policy/algorithm, Process (P2) faces partial starvation and waits for the longer time to execute. Which one of the following algorithms addresses this problem?
Q4.What is the average waiting time for these processes with non-preemptive Shortest Job First (SJF) scheduling Algorithm?
Q5.What is the average turnaround time for these Processes with First Come First Serve (FCFS) scheduling Algorithm?
Q6.Find the average weighted turnaround time for these process using Highest Response Ratio Next (HRN) Algorithm?
Q7.Which of the following does not interrupt a running process?
Q8.Consider the following table of arrival time and burst time for three processes P0, P1, P2: Process arrival time Burst time P0 0 ms 7 P1 1 ms 3 P2 2 ms 7 The pre-emptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or completion of a process. What is the average waiting time for the three processes? 
Q9.An OS follows round-robin scheduling with time quantum of 4ms. Assuming that the CPU is free now and there are 20 processes waiting in the ready queue, the maximum amount of time that a process waits before getting into the CPU is _________. 
Q10.Which of the following statements are true? A. Shortest remaining time first scheduling may cause starvation B. Preemptive scheduling may cause starvation C. Round robin is better than FCFS in terms of response time Choose the correct answer from the options given below: 

More CPU Scheduling Questions

Q1.Which of the following is a benefit of scheduling emails?
Q2.Calculate the average response time for these processes with a nonpreemptive priority Scheduling algorithm? Priority of the process are as follows and consider that all the processes came at zero (0) time. (Note low numbers represent high priority). Process Arrival Time Burst Time P1 5 3 P2 3 1 P3 2 5 P4 3 4 P5 1 2
Q3.When we apply Shortest Job First (SJF) scheduling Policy/algorithm, Process (P2) faces partial starvation and waits for the longer time to execute. Which one of the following algorithms addresses this problem?
Q4.What is the average waiting time for these processes with non-preemptive Shortest Job First (SJF) scheduling Algorithm?
Q5.What is the average turnaround time for these Processes with First Come First Serve (FCFS) scheduling Algorithm?
Q6.Find the average weighted turnaround time for these process using Highest Response Ratio Next (HRN) Algorithm?
Q7.Which of the following does not interrupt a running process?
Q8.The head of a moving head disk with 200 tracks, numbered 0 to 199, has just finished a request at track 125, and currently serving a request at track 143. The queue of requests is given in the FIFO order as 86, 147, 91, 177, 94, 150, 102, 175, 130. What will be the total number of head movements required to satisfy these requests for SCAN algorithm ? 
Q9.Consider the following table of arrival time and burst time for three processes P0, P1, P2: Process arrival time Burst time P0 0 ms 7 P1 1 ms 3 P2 2 ms 7 The pre-emptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or completion of a process. What is the average waiting time for the three processes? 
Q10.Consider a disk system with cylinders. The request to access the cylinders occurs in the following sequence: 4, 34, 10, 7, 19, 73, 2, 15, 6, 20 Assuming that the head is currently at cylinder 50, what is the time taken to satisfy all requests if it takes 1 ms to move from one cylinder to adjacent one and shortest seek time first policy is used? 

More Operating Systems Questions

Q1.Which of the following is a benefit of scheduling emails?
Q2.Which of the following Page Replacement Algorithm suffers from the Belady’s anomaly ?
Q3.Consider a system with three frames in memory and following memory references in the working set 2 1 2 3 5 4 1 3 4 2 1 How many page fault will be there if we use second chance page replacement algorithm ?
Q4.Which one of the following cannot be scheduled by the kernel ?
Q5.Consider a system with page size p and average process size m and size of each page table entry is e. What is the amount of space required by page table ? 
Q6.Calculate the average response time for these processes with a nonpreemptive priority Scheduling algorithm? Priority of the process are as follows and consider that all the processes came at zero (0) time. (Note low numbers represent high priority). Process Arrival Time Burst Time P1 5 3 P2 3 1 P3 2 5 P4 3 4 P5 1 2
Q7.When we apply Shortest Job First (SJF) scheduling Policy/algorithm, Process (P2) faces partial starvation and waits for the longer time to execute. Which one of the following algorithms addresses this problem?
Q8.What is the average waiting time for these processes with non-preemptive Shortest Job First (SJF) scheduling Algorithm?
Q9.What is the average turnaround time for these Processes with First Come First Serve (FCFS) scheduling Algorithm?
Q10.Find the average weighted turnaround time for these process using Highest Response Ratio Next (HRN) Algorithm?
Exams
Test Series
SuperCoaching
Previous Year Papers
Latest Updates
MCQ Questions
Testbook Products & Resources for Students
Testbook USA
Books
Testbook Edu Solutions Pvt. Ltd.
1st & 2nd Floor, Zion Building,
Plot No. 273, Sector 10, Kharghar,
Navi Mumbai - 410210
[email protected]
Toll Free:1800 833 0800
Office Hours: 10 AM to 7 PM (all 7 days)
Company
About usCareers We are hiringTeach Online on TestbookPartnersMediaSitemap
Products
Test SeriesTestbook PassOnline CoursesOnline VideosPracticeBlogRefer & EarnBooks
Our Apps
Follow us on
Copyright © 2014-2022 Testbook Edu Solutions Pvt. Ltd.: All rights reserved
User PolicyTermsPrivacy
Get Free Access Now
Hot Links： teen patti sequence online teen patti real money teen patti master real cash teen patti flush