1,710 views
1 votes
1 votes

Q. An SJF algorithm is simply a priority algorithm where the priority is :

A) predicted next cpu burst 

B) The inverse of the predicted next cpu burst 

C) the current cpu burst 

D)anything the user want

so in this what will be the ans it's a) or c) ? I confused with these two options.please gives proper explanation.

3 Answers

Best answer
2 votes
2 votes
i hope option c, as predicted current cpu burst

then option c is correct as per me
selected by
1 votes
1 votes

Ans is A.

SJF algorithm is practically infeasible as it depends on the predicted burst time

0 votes
0 votes
Not a very well formed question.

In GATE question they specifically mention if higher number mean more priority or lower number.

If its former A is correct, later than its B.

Why not C? We cannot predict actual BT, so we predict the next BT and set priority accordingly.

Related questions

0 votes
0 votes
1 answer
2
nikkey123 asked Dec 30, 2017
501 views
Solve the problem please
0 votes
0 votes
0 answers
4
saif asked Nov 17, 2018
279 views
Does context switch time depends on scheduling algorithms??