ASSIGNMENT
1. Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:
Process Burst Time Priority
P1 4 6 7
P2 3 2 0
P3 1 8 5
P4 7 9 8
P5 4 3 2
The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0.
a. Draw four Gantt charts illustrating the execution of these processes using FCFS,SJF,A non preemptive priority (a smaller priority number implies a higher priority), and RR (quantum = 2) scheduling.
b. What is the turnaround time of each process for each of the scheduling algorithms in part a?
c. What is the waiting time of each process for each of the scheduling algorithms in Part a?
d. Which of the schedules in part a results in the minimal average waiting time (over all processes)?
2. Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6.
How many page faults would occur for the following replacement algorithms, assuming one, two, three, four, five, six, or seven frames?
Remember all frames are initially empty, so your first unique pages will all cost one fault each.
LRU replacement
FIFO replacement
Optimal replacement
3. Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:
Process Burst Time Priority
1. P1 5 4 3
2 .P2 2 6 7
3. P3 8 2 4
4. P4 7 3 1
5. P5 6 4 3
The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0.
a. Draw four Gantt charts illustrating the execution of these processes using FCFS,SJF,A non preemptive priority (a smaller priority number implies a higher priority), and RR (quantum = 3) scheduling.
b. What is the turnaround time of each process for each of the scheduling algorithms in part a?
c. What is the waiting time of each process for each of the scheduling algorithms in Part a?
d. Which of the schedules in part a results in the minimal average waiting time (over all processes)?
4. Windows 7, Windows 8, Windows 10
5. Consider the following page reference string:
7,2,4,3,8,9,4,1,6,7,9,1,4,5,3,8,7,6,4,2,1,2.
How many page faults would occur for the LRU, FIFO, LFU and optimal page replacement algorithms assuming three and five frames?