Preemptive SJF is also called SRTF(Shortest Remaining Time First)

Que1- 

P No. AT BT
1 0 7
2 1 5
3 2 3
4 3 1
5 4 2
6 5 1

Solution-

gantt sol 7

P No. AT BT TAT WT CT
1 0 7 19 13 19
2 1 5 12 7 13
3 2 3 4 1 9
4 3 1 1 0 4
5 4 2 5 3 6
6 5 1 2 1 7
      43/6=7.16 24/6=4  

Que2-

QUES 2

Solution-

gantt sol 8

QUE2ANS

 

Que3- 

P No. AT BT
1 2 8
2 7 1
3 6 2
4 3 6
5 5 4

Solution-

gantt sol 9

QUE3ANS

 

Que4-

P No. AT BT
1 0 9
2 1 4
3 2 9

Solution-

gantt sol 10

Ques4Ans

 

Que5- What is the Turn Around Time and Waiting Time of process p2?

P No. AT BT CT
1 0 20 20
2 15 25 55
3 30 10 40
4 45 15 70

 

Solution-

gantt sol 11

P No. AT BT CT TAT WT
1 0 20 20    
2 15 25 55 40 50
3 30 10 40    
4 45 15 70

Que6- Calculate Average Turnaround Time.

P No. AT BT
P1 0 5
P2 1 3
P3 2 3
P4 4 1

Solution-

gantt sol 12

 

que6ans

 

 

     

Incoming search terms:

  • srtf
  • questions on srtf
  • srtf example
  • srtf problem in os
  • srtf numericals
  • cpu scheduling example problems with solutions
  • some questions of srtf algorithm for practice
  • solve primitivee in os of Bt and At given
  • err doing srtf an eye design 3
  • srtf with examples

This article has 2 comments

Leave a Reply