Scribd
Upload
74 views1 page

Assignment 4 (Marks 20)

This document contains instructions for two questions regarding disk scheduling algorithms. Question 1 asks to apply the Shortest Seek Time First (SSTF) and First Come First Served (FCFS) scheduling algorithms to a request sequence and find the seek operational result with an initial head position of 50. Question 2 gives a queue of pending disk requests and asks to calculate the total distance the disk arm would move to satisfy all requests under FCFS and SSTF scheduling, starting from the current head position of cylinder 2,150.

Uploaded by

Arbaz Khan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
74 views1 page

Assignment 4 (Marks 20)

This document contains instructions for two questions regarding disk scheduling algorithms. Question 1 asks to apply the Shortest Seek Time First (SSTF) and First Come First Served (FCFS) scheduling algorithms to a request sequence and find the seek operational result with an initial head position of 50. Question 2 gives a queue of pending disk requests and asks to calculate the total distance the disk arm would move to satisfy all requests under FCFS and SSTF scheduling, starting from the current head position of cylinder 2,150.

Uploaded by

Arbaz Khan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

ASSIGNMENT 4 (MARKS 20)

Question 1: Apply SSTF & FCFS Scheduling Algorithms and Request sequence = {176, 79, 34,
60, 92, 11, 41, 114,90 ,30 ,14 ,20 ,80 ,66}
Initial head position = 50. Find out the seek operational result.

Question 2: Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is
currently serving a request at cylinder 2,150, and the previous request was at cylinder 1,805. The
queue of pending requests, in FIFO order, is: 2,069, 1,212, 2,296, 2,800, 544, 1,618, 356, 1,523,
4,965, 3681.

Starting from the current head position, what is the total distance (in cylinders) that the disk arm
moves to satisfy all the pending requests for each of the following disk-scheduling algorithms?

a. FCFS

b. SSTF

You might also like