QUESTION 1 : MCA 4th semester Solved Assignment MCS-041 Operating Systems Question 1
Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:
| Process | Burst Time | Priority |
| P1 | 10 | 3 |
| P2 | 3 | 1 |
| P3 | 4 | 3 |
| P4 | 5 | 4 |
| P5 | 6 | 2 |
The processes are assumed to have arrived in the order P1, P2, P3, P4, and P5, all at the same time.
- a. Draw Gantt charts illustrating the execution of these processes using FCFS, SJF, a non-preemptive priority (a smaller priority number implies a higher priority), and Round Robin(quantum = 1) scheduling.?
- b. What is the turn around 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. Explain the evaluation of each algorithm.?
SOLUTION: ....
No comments:
Post a Comment