Register

Recent questions tagged disk-scheduling

507
views
1 answers
5 votes
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...
User Avatar
634
views
1 answers
5 votes
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...
User Avatar
1.3k
views
1 answers
0 votes
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
User Avatar
128
views
1 answers
1 votes
GO Classes 2024 | IIITH Mock Test 5 | Question: 7
Consider the following requests to read data from cylinders of a hard drive, where the current position of the head is at cylinder $73$ and the head is moving towards cylinder $0 .$ What is the order in which the cylinders in the queue would be serviced using the SCAN ... $84,89,91,92,95,102,143,1,17,25,32,50,56,72$
Consider the following requests to read data from cylinders of a hard drive, where the current position of the head is at cylinder $73$ and the head is moving towards c...
User Avatar
622
views
1 answers
2 votes
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...
User Avatar
461
views
1 answers
4 votes
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...
User Avatar
4.8k
views
1 answers
2 votes
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, ...
User Avatar
840
views
1 answers
1 votes
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...
User Avatar
1.0k
views
1 answers
3 votes
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...
User Avatar
593
views
2 answers
2 votes
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...
User Avatar
2.6k
views
3 answers
1 votes
UGC NET CSE | October 2020 | Part 2 | Question: 16
Consider a disk system having $60$ cylinders. Disk requests are received by a disk drive for cylinders $10,22,20,2,40,6$ and $38$, in that order. Assuming the disk head is currently at cylinder $20$, what is the ... one and Shortest Seek Time First (SSTF) algorithm is used? $240$ milliseconds $96$ milliseconds $120$ milliseconds $112$ milliseconds
Consider a disk system having $60$ cylinders. Disk requests are received by a disk drive for cylinders $10,22,20,2,40,6$ and $38$, in that order. Assuming the disk head i...
User Avatar
1.1k
views
3 answers
0 votes
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 35
Disk request come to a disk driver for cylinders in the order $10,22,20,2,40,6$ and $38,$ at a time when the disk drive is reading from cylinder $20$. The seek time is $6\text{ ms}$ per cylinder. The total seek time, if the disk arm scheduling algorithm is first-come-first-served is $900$ ms $850$ ms $360$ ms $876$ ms
Disk request come to a disk driver for cylinders in the order $10,22,20,2,40,6$ and $38,$ at a time when the disk drive is reading from cylinder $20$. The seek time is $6...
User Avatar
914
views
1 answers
0 votes
NIELIT 2017 July Scientist B (CS) - Section B: 35
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$. The pending requests (in order of their arrival) are for track numbers. ... ) 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...
User Avatar
5.5k
views
6 answers
1 votes
UGC NET CSE | January 2017 | Part 3 | Question: 50
Consider a disk queue with I/O requests on the following cylinders in their arriving order: $6,10,12,54,97,73,128,15,44,110,34,45$. The disk head is assumed to be at cylinder $23$ and moving in the direction of decreasing number of ... in the disk is $150$. The disk head movement using SCAN -scheduling algorithm is: $172$ $173$ $227$ $228$
Consider a disk queue with I/O requests on the following cylinders in their arriving order: $6,10,12,54,97,73,128,15,44,110,34,45$. The disk head is assumed to be at cyli...
User Avatar
5.4k
views
1 answers
8 votes
GATE CSE 2020 | Question: 35
Consider the following five disk five disk access requests of the form (request id, cylinder number) that are present in the disk scheduler queue at a given time. $(P, 155), (Q,85), (R,110),(S, 30), (T,115)$ Assume the head is positioned at ... ,but before $T$. The head reverses its direction of movement between servicing of $Q$ and $P$. $R$ is serviced before $P$.
Consider the following five disk five disk access requests of the form (request id, cylinder number) that are present in the disk scheduler queue at a given time.$(P, 155...
User Avatar
446
views
1 answers
0 votes
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...
User Avatar
880
views
1 answers
0 votes
Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 32 (Page No. 432)
A slight modification of the elevator algorithm for scheduling disk requests is to always scan in the same direction. In what respect is this modified algorithm better than the elevator algorithm?
A slight modification of the elevator algorithm for scheduling disk requests is to always scan in the same direction. In what respect is this modified algorithm better th...
User Avatar
Page: