search
Log In
1 vote
954 views
Five jobs are waiting to run. Their expected run times are 9,6,3,5,10....which job scheduling technique will result in minimum avg response time.

1) SJF

2) FCFS

3)PRIORITY

4) ROUND ROBIN
in Operating System 954 views
0
is it round robin scheduling?as in it,every process will get early chance due to time quantums.u can take example of time quantum = 2 sec and arrival time of all processes as equal.
0
ooh yaa......you are right ,,then right answer may be round robin .
0
But here it ask.... Minimum avg response time.. Not waiting time..
0
how r u telling this? What is meaning of expected runtime?
0
Since time quantum is not given.... Wat happen if we take large time quantum.... Den which has minm response time???

1 Answer

0 votes
we can't support to RR bcz if time quantum is too large then it work as FCFS..and here time quantum is not given.in this case SJF will give best result.

Related questions

1 vote
1 answer
1
237 views
the head of a movin disk with 100 tracks numbered 0 to 99 is serving a request at track 'x' if the requests of track 25, 76, 43,10,67 are served using fifo algo. then head movements are 194 the track 'x' initially served was.?
asked Aug 21, 2017 in Operating System aaru14 237 views
0 votes
0 answers
2
34 views asked Apr 3, 2019 in Mathematical Logic Manoj Kumar Pandey 34 views
0 votes
1 answer
3
70 views
The round trip delay between X and Y is given as 60 ms and bottle neck bandwidth of link between X and Y is 512 KBps. What is the optimal window size (in packets) if the packet size is 64 bytes and channel is full duplex. As it is mentioned that channel is full duplex , so will it be changing the approach to solve the question?
asked Mar 14, 2019 in Computer Networks shreys02 70 views
0 votes
0 answers
4
106 views asked Oct 17, 2018 in Algorithms Chetan28kumar 106 views
...