• edited by
1,205 views
0 0 votes
Q )Six jobs are waiting to be run. The expected running times are 9, 7, 5, 2, 1 and x respectively. Where 5 < x < 7 and the average completion time is 13. Find the value of x using SJF algorithm? (Assume all jobs arrive at same time = 0).

a)3.33

b)4.33

c)5.33

d)6.33

3 Answers

Position:
Show:

Related questions

0 0 votes
1 1 answer
994
994 views
parulnabi asked Sep 2, 2016
994 views
Which of the following algorithm has the smallest memory requirement, including data space and run time stack for recursive calls?<ol style="list-style-type:upper-alpha">...
0 0 votes
0 0 answers
532
532 views
esperanzajpalmer asked May 9, 2017
532 views
Since thesis writing is a challenging task, nearly all the students will look for someone to help them expertly. At present, the learners can find a plenty of academic wr...
0 0 votes
1 1 answer
371
371 views
ARUN_YADAV 1 asked Dec 3, 2025
371 views
After the k-th pass of Selection Sort (0-indexed), how many elements are definitely in their final sorted positions?
1 1 vote
3 3 answers
1.1k
1.1k views
aaaaaaaa asked Jul 22, 2018
1,126 views
while solving this recursive equation:T(n)=T(n/3)+T(2n/3)+n;i tried the master theorem ignoring the less long term T(n/3)this gave me : T(n)=T(2n/3)+n; and it leads to O(...