Page 437 - Computer_Science_F5
P. 437
Computer Science Gantt chart (visual representation of Write a report that document the key
Deliverable:
process execution), and calculate the
turnaround time for each process.
experimental procedures, including
the screenshots of the setup in each
Step 5: Analyse FCFS
step and the results. Document them in
FOR ONLINE READING ONLY
(a) How do processes with shorter
burst times fare in this algorithm? your portifolio.
(b) Observe the waiting time for each Exercise 7.3:
process. Does it seem fair?
1. How does CPU scheduling impact
Step 6: Experiment with SJF a digital workflow of a computer
Click on “Algorithms” and select user?
“Shortest Job First (SJF).” 2. Research and compare different
CPU scheduling algorithms used
Step 7: Run the simulation again by three operating systems of your
Use the same processes you created choice. Work with a colleague
earlier. Observe the execution order, to create a table or infographic
Gantt chart, and turnaround times. summarizing the strengths and
Step 8: Compare and analyse weaknesses of each algorithm.
(a) How does the turnaround time for 3. Imagine you are part of a
each process differ between FCFS development team creating a new
and SJF? operating system for a self-driving
(b) Which algorithm seems to favor car. Explain how CPU scheduling
shorter processes? algorithms play a critical role in
ensuring real-time response for
(c) Discuss the advantages and critical tasks like braking or sensor
disadvantages of each algorithm data processing.
based on the simulation results.
Step 9: Change the burst times Memory management
Modify the burst times of some In addition to CPU scheduling, the OS is
processes and rerun both simulations. also responsible for allocating memory
Does it alter the scheduling outcomes? space to different processes when
needed. Main memory is the physical
Step 10: Explore more algorithms RAM available in a computer. The OS
The website offers other scheduling performs main memory management
algorithms like Round Robin (RR) and through different memory allocation
Priority Scheduling. Experiment with strategies, including the following:
them and see how they impact process (a) First-Fit: A memory block is
execution and turnaround time. allocated to the first process that fits
428
for Advanced Secondary Schools
Computer Science Form 5.indd 428 23/07/2024 12:34

