ITGN 256 UD Introduction to Operating System Cover Sheet – Description
Perform the following tasks for the given CPU scheduling algorithms:
1. Draw the Gant chart [2 Marks]
2. Calculate the average waiting time [2 Marks]
Case1: First Come First Serve Scheduling algorithm
Case2: Priority Scheduling algorithm Question 2: [5 Marks]
Determine the total head movement using the given detailed head movement diagram.
Queue for the different disk scheduling algorithms listed below
Case1: FCFS Scheduling [2 Marks]
Case2: SSTF Scheduling [2 Marks]
Queue = 15, (20+id1*id2), 50, (25+ id2*id3), 40, 20+id4
Head starts at 25
Presentation followed by questions and answers [1 Mark]
If you assume that your student ID number is S0000001234, then id1=1, id2=2,
id3=3 and id4=4. id is S0000003068
The post ITGN 256 UD Introduction to Operating System Cover Sheet first appeared on .