Search results for disk-scheduling / GATE Overflow for GATE CSE

19 votes

1 answer

1

GATE CSE 1995 | Question: 20
The head of a moving head disk with $100$ tracks numbered $0$ to $99$ is currently serving a request at track $55$. If the queue of requests kept in FIFO order is $10, 70, 75, 23, 65$ which of the two disk scheduling algorithms ... Come First Served) and SSTF (Shortest Seek Time First) will require less head movement? Find the head movement for each of the algorithms.

The head of a moving head disk with $100$ tracks numbered $0$ to $99$ is currently serving a request at track $55$. If the queue of requests kept in FIFO order is $$10, 7...

Kathleen

122k views

Kathleen asked Oct 8, 2014

94 votes

16 answers

2

GATE IT 2007 | Question: 83
The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. What is the maximum cardinality of the request set, so that the head changes its direction after servicing every request if the total number of tracks are $2048$ and the head can start from any track? $9$ $10$ $11$ $12$

The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. What is the maximum cardinality of the request set, so that the head changes...

Ishrat Jahan

23.2k views

Ishrat Jahan asked Oct 30, 2014

57 votes

4 answers

3

GATE CSE 2004 | Question: 12
Consider an operating system capable of loading and executing a single sequential user process at a time. The disk head scheduling algorithm used is First Come First Served (FCFS). If FCFS is replaced by Shortest Seek Time First (SSTF), claimed by the vendor to give ... is the expected improvement in the I/O performance of user programs? $50 \%$ $40\%$ $25\%$ $0\%$

Consider an operating system capable of loading and executing a single sequential user process at a time. The disk head scheduling algorithm used is First Come First Serv...

Kathleen

17.0k views

Kathleen asked Sep 18, 2014

5 votes

1 answer

4

GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 62
At a particular point in time, the buffer cache has dirty data that needs to be flushed to disk. Suppose that the identities of these blocks can be listed in [track:sector] form as follows: ... Shortest Seek Time First Scan (initially moving upwards) Look (initially moving upwards) C-SCAN (initially moving upwards)

At a particular point in time, the buffer cache has dirty data that needs to be flushed to disk. Suppose that the identities of these blocks can be listed in [track:secto...

GO Classes

452 views

GO Classes asked Feb 5

5 votes

1 answer

5

GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 43
Consider the following $6 \;\mathrm{I} / \mathrm{O}$ operations and their respective cylinder locations on disk. Seek time is $0.1$ milliseconds per cylinder traversed. The cylinders are numbered from $0$ to $99.$ ... total time we spend seeking is $\mathrm{Y}$ milliseconds. What is $10 \ast(\mathrm{X}-\mathrm{Y})?$

Consider the following $6 \;\mathrm{I} / \mathrm{O}$ operations and their respective cylinder locations on disk. Seek time is $0.1$ milliseconds per cylinder traversed. T...

GO Classes

573 views

GO Classes asked Jan 13

0 votes

1 answer

6

Find seek time using FCFS,SSTF, SCAN.C-SCAN, LOOK for the following string 98, 183, 37, 122, 14, 124, 65, 67 Assume that request queue (0-199).and Head pointer 53

Find seek time using FCFS,SSTF, SCAN.C-SCAN, LOOK for the following string98, 183, 37, 122, 14, 124, 65, 67Assume that request queue (0-199).and Head pointer 53

aritrik7849

667 views

aritrik7849 asked Nov 24, 2023

2 votes

1 answer

7

DRDO CSE 2022 Paper 2 | Question: 8
If the disk head is initially located at track $32,$ find the number of disk moves required with First Come First Serve $\text{(FCFS)}$ scheduling criteria if the disk queue of $\text{I/O}$ blocks requests are: $90 \; 77 \; 24 \; 104 \; 55 \; 87.$

If the disk head is initially located at track $32,$ find the number of disk moves required with First Come First Serve $\text{(FCFS)}$ scheduling criteria if the disk qu...

admin

545 views

admin asked Dec 15, 2022

4 votes

1 answer

8

GO Classes Test Series 2023 | Operating Systems | Test 4 | Question: 13
Given a disk with $200$ tracks, where track requests are received in the following order $55, 58, 39, 18, 90, 160, 150, 38, 184.$ The starting position for the arm is track $100.$ What is the number of tracks crossed when the elevator algorithm, starting in the direction UP, algorithm is used?

Given a disk with $200$ tracks, where track requests are received in the following order $55, 58, 39, 18, 90, 160, 150, 38, 184.$ The starting position for the arm is tra...

GO Classes

400 views

GO Classes asked Oct 9, 2022

0 votes

1 answer

9

Galvin Edition 9 Exercise 10 Question 11 (Page No. 498-499)
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$ ... disk-scheduling algorithms ? $a. FCFS$ $b. SSTF$ $c. SCAN$ $d. LOOK$ $e. C-SCAN$ $f. C-LOOK$

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 cy...

akash.dinkar12

666 views

akash.dinkar12 asked Mar 22, 2019

45 votes

5 answers

10

GATE CSE 2016 Set 1 | Question: 48
Cylinder a disk queue with requests for $I/O$ to blocks on cylinders $47, 38, 121, 191, 87, 11, 92, 10.$ The C-LOOK scheduling algorithm is used. The head is initially at cylinder number $63$, moving towards larger cylinder ... are numbered from $0$ to $199$. The total head movement (in number of cylinders) incurred while servicing these requests is__________.

Cylinder a disk queue with requests for $I/O$ to blocks on cylinders $47, 38, 121, 191, 87, 11, 92, 10.$ The C-LOOK scheduling algorithm is used. The head is initially at...

Sandeep Singh

19.5k views

Sandeep Singh asked Feb 12, 2016

34 votes

4 answers

11

GATE CSE 2014 Set 1 | Question: 19
Suppose a disk has $201$ cylinders, numbered from $0$ to $200$. At some time the disk arm is at cylinder $100$, and there is a queue of disk access requests for cylinders $30, 85, 90, 100, 105, 110, 135$ ... First (SSTF) is being used for scheduling the disk access, the request for cylinder $90$ is serviced after servicing ____________ number of requests.

Suppose a disk has $201$ cylinders, numbered from $0$ to $200$. At some time the disk arm is at cylinder $100$, and there is a queue of disk access requests for cylinders...

go_editor

10.9k views

go_editor asked Sep 26, 2014

2 votes

1 answer

12

Applied Test Series
A disk drive has 5000 cylinders, numbered 0 to 4999. The drive is serving a request at cylinder 143 currently and the previous request was at 125. The disk I/O queue, in FIFO order, is 86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130 ... the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests, for SCAN?

A disk drive has 5000 cylinders, numbered 0 to 4999. The drive is serving arequest at cylinder 143 currently and the previous request was at 125. The disk I/O queue, ...

LRU

4.3k views

LRU asked Dec 28, 2021

0 votes

1 answer

13

Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 56 (Page No. 434)
Write a program to implement the three disk-arm scheduling algorithms. Write a driver program that generates a sequence of cylinder numbers $(0–999)$ at random, runs the three algorithms for this sequence and prints out the total distance (number of cylinders) the arm needs to traverse in the three algorithms.

Write a program to implement the three disk-arm scheduling algorithms. Write a driver program that generates a sequence of cylinder numbers $(0–999)$ at random, runs th...

admin

430 views

admin asked Oct 28, 2019

37 votes

5 answers

14

GATE CSE 2015 Set 1 | Question: 30
Suppose the following disk request sequence (track numbers) for a disk with $100$ tracks is given: $45, 20, 90, 10, 50, 60, 80, 25, 70.$ Assume that the initial position of the R/W head is on track $50$ ... is used compared to the SCAN (Elevator) algorithm (assuming that SCAN algorithm moves towards $100$ when it starts execution) is________________tracks.

Suppose the following disk request sequence (track numbers) for a disk with $100$ tracks is given:$45, 20, 90, 10, 50, 60, 80, 25, 70.$Assume that the initial position of...

makhdoom ghaya

23.9k views

makhdoom ghaya asked Feb 13, 2015

1 votes

1 answer

15

Live Test Series Live: Applied
We are given a hard disk of 500 GB. The performance details are : 5000 RPM rotation rate 200 cylinders, numbered from 1 to 200 Takes 1 + (n/20) milliseconds to move heads across n cylinders (e.g., from i to i + n). A ... the head travels half the cylinders and half a revolution. The average time taken to read a 1MB block from the hard disk is__? Need help.

We are given a hard disk of 500 GB. The performance details are :• 5000 RPM rotation rate• 200 cylinders, numbered from 1 to 200• Takes 1 + (n/20) milliseconds to m...

ramakrushna

794 views

ramakrushna asked Dec 22, 2021

2 votes

1 answer

16

Applied Grand Test 2
Given a disk with 100 cylinders (0 to 99). Exactly one time unit is required to move the read/write head from one cylinder to the next. At time 0 the heads are at cylinder 0 and no requests are pending. The following six requests ... of the heads in movement. Assuming, that rotational and transfer times are negligible, the total time required for the Scan algorithm is _____

Given a disk with 100 cylinders (0 to 99). Exactly one time unit is required to move the read/write head from one cylinder to the next. At time 0 the heads are at cylinde...

LRU

899 views

LRU asked Nov 22, 2021

2 votes

2 answers

17

Applied Test Series
In a system SCAN, disk scheduling policy has been used. The number of tracks traversed by the head if the disk has 200 tracks and the requested tracks, in the order received, are 65, 48, 39, 08, 99, 164, 152, 38, 124 PS : Assume initial head position is at 65, and it will move towards 0

In a system SCAN, disk scheduling policy has been used. The number of tracks traversed by the head if the disk has 200 tracks and the requested tracks, in the order recei...

LRU

550 views

LRU asked Oct 20, 2021

28 votes

4 answers

18

GATE IT 2004 | Question: 62
A disk has $200$ tracks (numbered $0$ through $199$). At a given time, it was servicing the request of reading data from track $120$, and at the previous request, service was for track $90$ ... Time First) and FCFS (First Come First Serve)? $2$ and $3$ $3$ and $3$ $3$ and $4$ $4$ and $4$

A disk has $200$ tracks (numbered $0$ through $199$). At a given time, it was servicing the request of reading data from track $120$, and at the previous request, service...

Ishrat Jahan

10.4k views

Ishrat Jahan asked Nov 2, 2014

5 votes

2 answers

19

UGC NET CSE | June 2016 | Part 2 | Question: 38
If the Disk head is located initially at track 32, find the number of disk moves required with FCFS scheduling criteria if the disk queue of I/O blocks requests are 98, 37, 14, 124, 65, 67 320 322 321 319

If the Disk head is located initially at track 32, find the number of disk moves required with FCFS scheduling criteria if the disk queue of I/O blocks requests are 98, 3...

go_editor

19.9k views

go_editor asked Aug 16, 2016

5 votes

1 answer

20

UGC NET CSE | December 2013 | Part 2 | Question: 48
Consider a disk queue with request for input/output to block cylinders 98, 183, 37, 122, 14, 124, 65, 67 in that order. Assume that disk head is initially positioned at cylinder 53 and moving towards cylinder number 0. ... ) and SCAN algorithms are respectively 236 and 252 cylinders 640 and 236 cylinders 235 and 640 cylinders 235 and 252 cylinders

Consider a disk queue with request for input/output to block cylinders 98, 183, 37, 122, 14, 124, 65, 67 in that order. Assume that disk head is initially positioned at c...

go_editor

21.3k views

go_editor asked Jul 26, 2016

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true