Janna Andrea G.

Justiniano TN26

1. First Come, First Serve

 In a First Come, First Serve (FCFS) scheduling system, processes are completed in the order
they appear in the queue. This means that the computer will handle the first process that
arrives. FCFS does not interrupt processes once they begin, making it a continuous scheduling
method. However, FCFS has a drawback known as the "convoy effect," in which shorter tasks
may be delayed by longer ones going first. While FCFS is simple, it may not always be the most
efficient, particularly when dealing with processes of varying length.


2. Shortest Job First

 In a Shortest Job First (SJF) scheduling system for operating systems, the process with the
shortest execution time is prioritized and executed first. This scheduling algorithm aims to
reduce total processing time and wait times for shorter tasks. SJF can be preemptive or non-
preemptive; in the preemptive case, if a shorter job arrives while another is being processed,
the current job may be interrupted. The primary benefit of SJF is its efficiency in reducing
overall completion time; however, predicting the exact execution time of a process can be
difficult, resulting in potential scheduling inaccuracies.
3. First in, First out
 A First In First Out (FIFO) scheduling system for operating systems executes processes in the
order they arrive, similar to waiting in a queue. The first process that enters the system is the
first that the CPU processes. FIFO is a non-preemptive scheduling algorithm, which means
that once started, a process will run uninterrupted until it is completed. While FIFO is simple
and easy to understand, it may not always be the most efficient, particularly if shorter tasks
must wait for longer ones to complete, potentially leading to delays and increased waiting
times.

4. Last in, First out

 In a Last In First Out (LIFO) scheduling system for operating systems, the process that arrives
last is executed first. It takes a stack-based approach, with the most recently added process
receiving priority. LIFO is a non-preemptive scheduling algorithm, which means that once
started, a process will run until completed without interruption. However, LIFO scheduling
can lead to potential inefficiencies because the last-arriving process is prioritized regardless
of execution time, resulting in longer wait times for shorter tasks. LIFO is less widely used in
practical operating systems than other scheduling algorithms.