A student who satisfactorily completes the assignment should be able to:

$\backslash$table$[[$Learning Objective,Course Outcome No$.],[\backslash$table$[[1.$ Identify how an operating system works and its$],[$architecture$.]],02],[\backslash$table$[[2.$ Demonstrate how os concepts are implemented in a real$],[$operating system.$]],03,04]]$

Perform the following tasks:

Task $1$: CPU Scheduling $-$Employ Preemptive SJF Scheduling to create a Gantt Chart and compute the average waiting time and average turnaround time for all processes. $(2$ Marks$)$

$\backslash$table$[[$Process$,$Arrival time,Burst Time $($in ms$)],[$P$1,0,9],[$P$2,8,1],[$P$3,3,3],[$P$4,7,5],[$P$5,4,4]]$

Task $2$: CPU Scheduling$-$Employ Priority Preemptive Scheduling to create a Gantt Chart and compute the average waiting time and average turnaround time for all processes. Consider the Lowest Number as the Highest Priority in the below table. $(2$ Marks$)$

$\backslash$table$[[$Process$,$Arrival time,Burst Time $($in ms$),$Priority$],[$A$,1,9,5],[$B$,0,1,1],[$C$,2,3,3],[$D$,5,6,2],[$E$,4,7,4]]$

Task $3$: Bankers Algorithm $-$Deadlock $(2$ Marks$)$

Apply the Banker's algorithm to determine whether the system is in a safe state or not, and then complete the NEED matrix. Afterward, identify the safe sequence.

$\backslash$table$[[$Process$,$Max,Allocation,Need,Available$],[R1,R2,R3,R1,R2,R3,$R$1,R2,R3,R1,R2,R3$