This repository contains the basic CPU Scheduling Algorithms from which an Operating System decides the sequencing or scheduling of process to be executed. All the algorithms inside are preemptive in nature, i.e. contact switching is possible. The algorithms include, First Come First Serve (FCFS), Shortest Job First (SJF), Round Robin and Priori…

Important OS Codes and Concepts(Sorted)

This Repository Contains List of Process Scheduling Algorithms, That Were Implemented By Me During OS (Operating System) Lab. This List Contains First Come First Serve (FCFS), Shortest-Job-First (SJF) Scheduling, Priority Scheduling (PS), and Round Robin Scheduling (RR) Algorithm.

A comprehensive collection of algorithms pertaining to Operating Systems. It encompasses a wide range of topics, including fundamental scheduling algorithms such as First Come First Serve (FCFS), Shortest Job First (SJF), and Round Robin (RR).

This is Operating System (CE354) practical.

Process Scheduling Algorithms implemented in C++.

In these codes we are applying shortest job first and first come first serve algorithm.

A generic "first come, first served" scheduler written in C, optimized for embedded systems