CPU Algorithm- Discussion Response

Read the post below and respond in your own words. Must be at least 100 words.

———————————————————————————————————————————
Let’s start with the basic concepts of scheduling. Scheduling  is a fundamental operating-system function. Almost all computer  resources are scheduled before use. The CPU is, of course, one of the  primary computer resources. Thus, its scheduling is central to the  operating-system design.
Round robin algorithm is one of the CPU scheduling algorithms  used to schedule processes in the CPU in a way that the time taken to  complete all processes is less. In this algorithm, every process is  given a fixed amount of time to complete its task and later again given  CPU if the duration is not completed. Meanwhile, other processes are  provided CPU for the same fixed amount of time in a cyclic way. This  process uses the concept of context switching so that states of  preemptive processes are saved.

First Come First Serve Scheduling

Strength:

Easy to understand and implement.
Starvation of processes is not there.

Weakness:

Wait time is very high.
Processes at the end have to wait for so long to get their chance to acquire CPU.
Shortest Job next Scheduling

Strength:

Beneficial for the processes with less burst time.
Short-time processes can be executed in a faster way.
Hence this increases the throughput.

Weakness:

Every time CPU has to check for the process available with the shortest time.
Processes with larger burst time have to wait
Starvation of processes is there
Processes at the end have to wait for so long to get their chance to acquire CPU.