Q# $6.$ Consider the set of $5$ processes whose arrival time and burst time are given in the table below, If the CPU

scheduling policy is priority non$-$preemptive, $($Higher number represents higher priority$),$ draw Gantt Chart and

calculate $($the average tumaround time and average waiting time$).$

Q# $7.$ Consider the set of $5$ processes whose arrival time and burst time are given in the table below, If the CPU

scheduling policy is priority preemptive, $($Higher number represents higher priority$),$ draw Gantt Chart and calculate

$($the average turnaround time and average waiting time$).$

Q# $8.$ What is the ultimate objective of Page Replacement Algorithms?

Q# $9.$ A system uses $3$ page frames for storing process pages in main memory. It uses the First in First out $($FIFO$)$ page

replacement policy. Assume that all the page frames are initially empty. What is the total number of page faults that will

occur while processing the page reference string given below$-$

$4,7,6,1,7,6,1,2,7,2$

Also, calculate the hit ratio and miss ratio.

Q# $10.$ A system uses $3$ page frames for storing process pages in main memory. It uses the Optimal page replacement

policy. Assume that all the page frames are initially empty. What is the total number of page faults that will occur while

processing the page reference string given below$-$

$4,7,6,1,7,6,1,2,7,2$

Also, calculate the hit ratio and miss ratio.

Q# $11.$ A system uses $3$ page frames for storing process pages in main memory. It uses the Least Recently Used $($LRU$)$

page replacement policy. Assume that all the page frames are initially empty. What is the total number of page faults that

will occur while processing the page reference string given below$-$

$4,7,6,1,7,6,1,2,7,2$

Also, calculate the hit ratio and miss ratio.