Explain with the help of an example which of the following scheduling algorithm could result in starvation.

5.5kviews

written 6.9 years ago by

snehalb • 910

modified 4.1 years ago by

IshanD • 40

a. First come first serve basis. b. Shortest Job first c. Round vobin d. Priority

operating systems

ADD COMMENT EDIT

1 Answer

579views

written 4.1 years ago by

IshanD • 40

The answer is b. If a process with shorter burst-time is present in the queue, the CPU has to execute that particular process before moving on to other processes with larger Burst time. This may create a problem for processes with larger Burst time because a new process might …

Create a free account to keep reading this post.

and 3 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.