What is deadlock? Explain deadlock prevention in detail. marks$)$

Suppose the head of a moving$-$head disk with $200$ tracks, numbered $0$ to $199,$ is Currently serving a request at track $50.$ If the queue of requests is kept in FIFO order:

$82,170,43,140,24,16,90$

What is the total head movement to satisfy these requests for the following Disk scheduling algorithms?

$($a$)$FCFS

$($b$)$ SSTF

$($c$)$ LOOK

$($d$)$ C $-$ LOOK

$($d$)$ SCAN

$($e$)$ C$-$ SCAN

$3.$ Consider following processes with length of CPU brust time in millisecond

$\backslash$table$[[$Process$,$Brust time,Priority$],[$P$1,10,3],[$P$2,1,1],[$P$3,2,3],[$P$4,1,4],[$P$5,5,2]]$

All processes arrived in order $P1,P2,P3,P4,P5$ all at time zero.

$($i$)$Draw Gantt charts illustrating execution of these processes for

a$)$ First Come First Served

b$)$ Shortest Job First

b$)$ Non preemptive priority

d$)$ Round robin$($quantum$=5)$

$($ii$)$ Calculate average waiting time for each scheduling algorithm in part $($i$)$

$4.$ Discuss in detail about paging