Hire Our Expert Programmer & Technical Writer to do your Capstone Project
+1 vote
111 views
in Compilers & Operating Systems by (user.guest)

1 Answer

+1 vote
by (user.guest)
selected by (user.guest)
 
Best answer
First Come First Serve is a scheduling algorithm that is used in the scheduling of tasks, or processes within the operating system. The First Come First Serve algorithm is one that executes process in the same order they came in, so whichever process comes in first will be executed first. Since the FCFS algorithm is non-preemptive in nature, if a process with a very large burst(Largest burst time among all the process) time comes first, it might lead to starvation of other process.

Related questions

+1 vote
1 answer 82 views
0 votes
1 answer 15 views
+1 vote
1 answer 214 views
Welcome to CPENTalk.com

Disclaimer: Every user is solely responsible for anything that he/she posts or uploads on CPENTalk.
...