Scribd
Upload
43 views

Operating System Assignment Disk Scheduling

This document provides instructions for Assignment 3 in the COMP 2604 course at the University of the West Indies. It consists of two questions worth a total of 28 marks. Question 1 asks students to analyze page faults for different page replacement algorithms with 4 and 5 frames. Question 2 asks students to calculate the total disk head movement distance to service requests for different disk scheduling algorithms. Students are instructed to submit a single text file with their answers to both questions named according to their student ID number.

Uploaded by

Daniel McDougall
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
43 views

Operating System Assignment Disk Scheduling

This document provides instructions for Assignment 3 in the COMP 2604 course at the University of the West Indies. It consists of two questions worth a total of 28 marks. Question 1 asks students to analyze page faults for different page replacement algorithms with 4 and 5 frames. Question 2 asks students to calculate the total disk head movement distance to service requests for different disk scheduling algorithms. Students are instructed to submit a single text file with their answers to both questions named according to their student ID number.

Uploaded by

Daniel McDougall
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

The University of the West Indies, St.

Augustine
Department of Computing and Information Technology
COMP 2604 - Semester II, 2022/2023
Assignment 3 – 7%
Due Date: April 7th 2023 @ 5 pm
Max. Marks: 28

1. Consider the following page reference string:


7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1, 0, 5, 4, 6, 2, 3, 0, 1.
Assuming demand paging with FOUR and FIVE frames, how many page faults would occur
and what is the page fault ratio of each for the following replacement algorithms?

a) First In First Out (FIFO) replacement


b) Optimal replacement
c) Least Recently Used (LRU) replacement
d) LRU replacement – Stack implementation
e) LRU replacement – Counter implementation
[20 marks]

2. Suppose a disk drive has 3000 cylinders, numbered 0 through 2999. Suppose that the drive
is currently servicing a request at cylinder 1430 and moving in the direction of increasing
cylinder numbers. The order of request in the request queue is as follows:
450; 1132; 2809; 23; 1908; 2189; 780; 736
Starting from the current head position, identify the total distance, in cylinders, that the arm
moves to satisfy all pending requests for the following disk scheduling algorithms. Show all
workings.
a) First Come First Serve (FCFS)
b) Shortest Seek Time First (SSTF)
c) SCAN
d) C-SCAN
[8 marks]

Submission Instructions:
Submit one single text file containing the answers to all two questions. Name the text file
“ID#Number_COMP2604_A3.docx”, e.g. “808000326_COMP2604_A3.docx”. Please upload
the text file to the Turnitin submission link on myElearning. Only 1 submission is allowed, so
be careful that your file submitted is the final version.

You are encouraged and appreciated to use any digital tool to do your illustrations for the both
questions.

Note: Include your Plagiarism declaration form in your submission as a separate file.
Properly name all the files and submit in the proper link.

Page 1 of 1

You might also like