Content text 06.Tutorial Ch 2.2.4-2.2.11 DFC10103.pdf
20 DEPARTMENT OF INFORMATION AND COMMUNICATION TECHNOLOGY COURSE WORK ASSESSMENT CODE & COURSE : DFC10103 – OPERATING SYSTEM PROGRAMME : DDT TUTORIAL ACTIVITY : 3 (2.2.4 – 2.2.11) CLO : CLO 1 – explain the operating system environment, the concept of memory, process and file management in operating system. (C2, PLO1) DURATION : 2 HOURS TOPIC 2: MEMORY AND PROCESS MANAGEMENT Instruction(s): Answer all questions. Activity 3D Activity outcome: Define the purpose of CPU Scheduler. Instruction: Describe the CPU Scheduler below: a. Short term scheduler b. Mid-term scheduler c. Long-term scheduler
21 Activity 3E Activity outcome: Certain scheduling algorithms can be considered preemptive while others are considered non-preemptive algorithms. Instruction: Answer all questions. a. Is First-Come First-Served scheduling a non-preemptive algorithm? Justify your answer. b. However a variation of the First-Come, First-Served scheduling does allow to preempt a process. Name this scheduling algorithm and explain how it works. Activity 3F Activity outcome: Draw scheduling algorithms Table 1 shows the First In First Out scheduling algorithm. Answer the following questions if the process arrives in order P3, P1, P2 and P4. Process/Proses Burst Time/Masa Burst P1 4 P2 8 P3 2 P4 1 i. Draw the appropriate Gantt chart.