Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged disk-scheduling
45
votes
5
answers
91
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__________.
Sandeep Singh
asked
in
Operating System
Feb 12, 2016
by
Sandeep Singh
19.3k
views
gatecse-2016-set1
operating-system
disk-scheduling
normal
numerical-answers
1
vote
1
answer
92
Scan cscan
plz explain scan cscan ,i have 2 books which gives 2 different implementation
Amey
asked
in
Operating System
Dec 17, 2015
by
Amey
1.3k
views
operating-system
disk-scheduling
3
votes
4
answers
93
OS
Which of the following disk scheduling policies results in the minimum amount of head movement? (A) FCFS (B) Circular scan (C) Elevator
Himanshu1
asked
in
Operating System
Oct 19, 2015
by
Himanshu1
2.9k
views
disk-scheduling
2
votes
5
answers
94
ISRO2014-14
There are 200 tracks on a disc platter and the pending requests have come in the order - 36, 69, 167, 76, 42, 51, 126, 12 and 199. Assume the arm is located at the 100th track and moving towards track 200. If sequence of disc access is 126, 167, ... , 36, 42, 51, 69 and 76 then which disc access scheduling policy is used? Elevator Shortest seek-time first C-SCAN First Come First Served
ajit
asked
in
Operating System
Sep 16, 2015
by
ajit
4.9k
views
disk-scheduling
isro2014
operating-system
37
votes
5
answers
95
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.
makhdoom ghaya
asked
in
Operating System
Feb 13, 2015
by
makhdoom ghaya
23.6k
views
gatecse-2015-set1
operating-system
disk-scheduling
normal
numerical-answers
28
votes
4
answers
96
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$
Ishrat Jahan
asked
in
Operating System
Nov 2, 2014
by
Ishrat Jahan
10.3k
views
gateit-2004
operating-system
disk-scheduling
normal
93
votes
15
answers
97
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$
Ishrat Jahan
asked
in
Operating System
Oct 30, 2014
by
Ishrat Jahan
23.1k
views
gateit-2007
operating-system
disk-scheduling
normal
31
votes
1
answer
98
GATE IT 2007 | Question: 82
The head of a hard disk serves requests following the shortest seek time first $\textsf{(SSTF)}$ policy. The head is initially positioned at track number $180$. Which of the request sets will cause the head to change its direction after servicing every request assuming that the head ... $10, 139, 169, 178, 181, 184, 201, 265$ $10, 138, 170, 178, 181, 185, 200, 265$
Ishrat Jahan
asked
in
Operating System
Oct 30, 2014
by
Ishrat Jahan
6.0k
views
gateit-2007
operating-system
disk-scheduling
normal
19
votes
1
answer
99
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.
Kathleen
asked
in
Operating System
Oct 8, 2014
by
Kathleen
122k
views
gate1995
operating-system
disk-scheduling
normal
descriptive
7
votes
1
answer
100
Disk scheduling
Disk requests come to a disk driver for cylinders in the order 10, 22, 20, 2, 40, 6 and 38 at a given time when the given disk drive is reading from cylinder 20. The seek time is 6ms per cylinder. 1.What is the total seek time, if the disk arm scheduling ... None 2.What is the total seek time, if the closest cylinder next scheduling is used? A)360 ms B)876 ms C)850 ms D)900 ms
Keith Kr
asked
in
Operating System
Oct 3, 2014
by
Keith Kr
24.7k
views
operating-system
disk-scheduling
24
votes
3
answers
101
GATE CSE 1997 | Question: 3.6
The correct matching for the following pairs is: ... $\text{A-4 B-3 C-2 D-1}$ $\text{A-2 B-4 C-1 D-3}$ $\text{A-3 B-4 C-3 D-2}$
Kathleen
asked
in
Operating System
Sep 29, 2014
by
Kathleen
5.7k
views
gate1997
operating-system
normal
disk-scheduling
match-the-following
34
votes
4
answers
102
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.
go_editor
asked
in
Operating System
Sep 26, 2014
by
go_editor
10.8k
views
gatecse-2014-set1
operating-system
disk-scheduling
numerical-answers
normal
29
votes
6
answers
103
GATE CSE 1999 | Question: 1.10
Which of the following disk scheduling strategies is likely to give the best throughput? Farthest cylinder next Nearest cylinder next First come first served Elevator algorithm
Kathleen
asked
in
Operating System
Sep 23, 2014
by
Kathleen
11.1k
views
gate1999
operating-system
disk-scheduling
normal
20
votes
3
answers
104
GATE CSE 2009 | Question: 31
Consider a disk system with $100$ cylinders. The requests to access the cylinders occur in following sequence: $4, 34, 10, 7, 19, 73, 2, 15, 6, 20$ Assuming that the head is currently at cylinder $50$ ... seek time first policy is used? $95 \;\text{ms}$ $119\;\text{ms}$ $233\;\text{ms}$ $276\;\text{ms}$
Kathleen
asked
in
Operating System
Sep 22, 2014
by
Kathleen
8.4k
views
gatecse-2009
operating-system
disk-scheduling
normal
56
votes
4
answers
105
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\%$
Kathleen
asked
in
Operating System
Sep 18, 2014
by
Kathleen
16.9k
views
gatecse-2004
operating-system
disk-scheduling
normal
Page:
« prev
1
2
3
4
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
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
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged disk-scheduling
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...