ASSIGNMENT
1. Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:
Process Burst Time Priority
1. P1 10 0 3
2 .P2 29 1 1
3. P3 3 2 4
4. P4 7 3 5
5. P5 12 4 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 = 1) 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 page reference string:
1,2,3,4,2,1,5,6,1,2,3,7,6,3,2,1,2,3,6
How many page faults would occur for the LRU, FIFO, LFU and optimal page replacement algorithms
assuming two and five frames?
4. Consider the following page reference string:
1,2,3,4,2,1,5,6,1,2,3,7,6,3,2,1,2,3,6
How many page faults would occur for the LRU, FIFO, LFU and optimal page replacement algorithms
assuming three and four frames?
5. Consider the following page reference string:
1,2,3,4,2,1,5,6,1,2,3,7,6,3,2,1,2,3,6
How many page faults would occur for the LRU, FIFO, LFU and optimal page replacement algorithms
assuming two and six frames?
6. Consider the following page reference string:
1,2,3,4,2,1,5,6,1,2,3,7,6,3,2,1,2,3,6
How many page faults would occur for the LRU, FIFO, LFU and optimal page replacement algorithms
assuming seven frames?
7. Consider the following page reference string: 7,5,7,8,6,0,1,8,9,7,5,4,3,2,1.
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
8. Consider the following page reference string: 8,5,6,4,7,2,1,9,7,2,0,1,6,8,9,0,1.
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
9. 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)?
10. Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:
Process Burst Time Priority
1. P1 4 6 7
2 .P2 3 2 0
3. P3 1 8 5
4. P4 7 9 8
5. 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)?
11. Linux System
12. System Administration, Requirements for Linux System Administrator
13. Setting up a LINUX Multifunction Server
14. Domain Name System and Setting up Local Network Services
15. Virtualization
16. Setting Up Xen
17. VMware on Linux Host
18. Adding Guest OS
19. Windows 7
20. Windows 8
21. Windows 10
22. Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:
Process Burst Time Priority
1. P1 4 5 6
2 .P2 3 4 2
3. P3 7 8 9
4. P4 5 2 3
5. P5 4 3 1
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 = 4) 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)?
23. Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:
Process Burst Time Priority
1. P1 4 3 5
2 .P2 8 9 7
3. P3 7 2 3
4. P4 1 2 4
5. P5 5 2 1
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 = 1) 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)?
24. Consider the following page reference string:
3,2,1,4,6,7,8,4,9,2,1,5,4,3,2,1
How many page faults would occur for the LRU, FIFO, LFU and optimal page replacement algorithms
assuming two, three, four and five frames?
25. 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?
