Answers
Can lead to longer processes being starved of processing time
Involves overhead due to frequent switching between processes
Processes with the shortest completion time are handled first
No reorganization of the queue, maintaining a simple process flow
Allocates a fixed time slice to each process in the queue
Low overhead with task switching only when a process completes
Ensures a balanced throughput and fair allocation of CPU time
Efficient for short processes with rapid response times
No prioritization of tasks, which may not be optimal for time-sensitive processes
Requires prior knowledge or estimation of execution times for each process
Can result in high wait times if longer processes are in the queue
Aims to reduce the average wait time by prioritizing quicker tasks
The process at the front of the queue runs first, followed by the next in line
Effective in preventing process starvation with no priority system
Processes the queue in the order items arrive
Long wait times possible if the queue has many processes
