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

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

1 Answer
0
573views

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 4 others joined a min ago.

Please log in to add an answer.