1. What is the average waiting time for Processes If theOperating System uses the Shortest-Job-First (SJF) SchedulingAlgorithm?

(P1=5 ms, P2=10 ms, P3=15 ms)

2. How many page faults occur in the Optimum Page Replacementalgorithm (OPR) with the following reference string for three-pageframes?   

Reference String: 4,2,1,3,2,3,4,1

3. What is the average waiting time for Processes If theOperating System uses Shortest-Job-Remaining-First (SJRF)Scheduling Algorithm?

(P1=5 ms, P2=10 ms, P3=15 ms)

Arrival Time ( P1=0 ms, P2=5 ms, P3=10 ms)

4. What is the average waiting time for Processes If OperatingSystem uses the First Come First Serve (FCFS) SchedulingAlgorithm?

(P1=5 ms, P2=10 ms, P3=15 ms)

Process Order: P2, P1, P3

5. What is the average waiting time for Processes If theOperating System uses Round Robin (RR) Scheduling Algorithm?

(P1=5 ms, P2=10 ms, P3=15 ms)

Time slice/ quantum = 5 ms

6. What is the average waiting time for Processes If theOperating System uses the Priority Scheduling (PS) SchedulingAlgorithm?

(P1=5 ms, P2=10 ms, P3=15 ms)

Priority Order: P3, P1, P2

7. How many page faults occur in the FIFO replacement algorithmwith the following reference string for THREE-page frames?  

Reference String: 4,2,1,3,2,3,4,1

8. How many page faults occur in the Least Recently UsedAlgorithm (LRU) with the following reference string for three-pageframes?   

Reference String: 4,2,1,3,2,3,4,1