Go Vol PDF
Go Vol PDF
account being blocked. We suggest not to concentrate on any test series questions as
you can easily get standard ones from Text books and University websites. Even then if
you are following test series’ it is your wish but only post questions here for which you
have right to do so. Below are some of the allowed ones here
(2) and (3) are not approved by the respective organizations but until they object you
may post their questions here but only with EXPLICIT Source name in Title.
Please do verify your account as we will soon restrict posting rights to verified users
only. Those who are already verified, please ignore.
https://gateoverflow.in/verify-user-page
All previous year GATE questions in CS & IT from 1987 onward are loaded on the
site. Please see the "Prev Exams" tab or search a part of the question text in google
custom search on the sidebar. For subject notes and reference links please see GATE
subjects For best video lectures for GATE CSE please see GO Youtube Channel For
recommended standard books for GATE CSE please see Best Books Please like our FB
page . This page won't spam you with posts.
Ask
GATE2009-51
+28
votes
5.4k views
asked Sep 22, 2014 in Operating System by Kathleen Veteran (52.1k points)
edited Jun 24, 2018 by kenzou
5.4k views
A hard disk has 63 sectors per track, 10 platters each with 2 recording surfaces and
1000 cylinders. The address of a sector is given as a triple ⟨c, h, s⟩, where c is the
cylinder number, h is the surface number and s is the sector number. Thus, the 0th
sector is addresses as ⟨0, 0, 0⟩ , the 1st sector as ⟨0, 0, 1⟩ , and so on
A. 505035
B. 505036
C. 505037
D. 505038
answer comment
+7
⟨400,16,29⟩ it means we have to cross 400 clyinder, 16 surfaces and 29 sectors
=400 *10*2*63
after reaching at 400th clylinder we have to go at 16th surface for which no. of
sectors to be crossed
now we are at 16th surface of 400th clylinder then we can directly go to 29th sector
of this surface
+1
@cse23
How did u interpreted that data on disk is stored cross sectionally ? and not
linearly ?
GATE2015-2-49
#Disk
harddisk
Hard disk
2 Answers
+63
votes
The data on a disk is ordered in the following way. It is first stored on the first sector
of the first surface of the first cylinder. Then in the next sector, and next, until all the
sectors on the first track are exhausted. Then it moves on to the first sector of the
second surface (remains at the same cylinder), then next sector and so on. It exhausts
all available surfaces for the first cylinder in this way. After that, it moves on to repeat
the process for the next cylinder.
Search...
Tag Search
Recent Posts
"
Reform in M.Tech Programmes
So, to reach to the cylinder numbered 400(401th cylinder) we need to skip 400 × (10
× 2 ) × 63 = 504, 000 sectors.
Then, to skip to the 16th surface of the cylinder numbered 400 , we need to skip
another 16 × 63 = 1, 008 sectors.
comment
comment
+1
In the statement "Finally, to find the 29 sector, we need to move another 29
sectors" in your explanation you said that we moved another 29 sectors to reach
sect 29, but finally we need to access sect 29 which is 30th sector and question
asks for that sect number which is having address 29 in 17th surface(surface no 16)
which is further on 401 st cylinder (cylinder number 400 ) .So according to me
answer is (D).
+17
It is true that the counting starts from 0, so the 29th sector is actually the 30th
sector. Or is it?!
Notice that although the counting begins with 0, the starting sector is labelled the
0th sector, and not the first.
So, to reach the sector marked by the address <0, 0, 3>, we need to goto the
sector labelled number 3 (not number 4)
...
–2
for b part chck the options to see who gives the desired no of sectrs
@Pragy but then how can you be sure that in convention <c,h,s> , for s the numbering
begins from 1 but for cylinder it begins from 0? It's nowhere mentioned in the question
that 1st cylinder is addressed as <1,0,0>
http://stackoverflow.com/questions/8950810/do-we-call-the-first-bit-in-a-byte-bit-1-
or-0
+3
@arjun sir ,
How could one interpret that data on disk is stored cross sectionally ? and not
linearly ?
+2
votes
First, let us understand the story behind the DISK's Model which I have inferred after
a two hour long research from this paper:
http://www2.cs.uh.edu/~paris/7360/PAPERS03/IEEEComputer.DiskModel.pdf
So, as per the question, there are 10 platters which are like the simple (2-sided) RW
CD..
A cylinder is a stack of tracks. Don't think them as tracks on a surface but a cross-
sectional stack of tracks across all the platters.
Imagine stacking all the platters one one top of the other (which they actually are on a
spindle) and then looking at a track which in turn is a cylinder through all the platters
below..
If the image is still unclear, refer to the diagrams in the paper or the web.
10 platters (2-sided),, 1000 cylinders per platter (or 500 per surface), 63 sectors per
track (which is on a cylinder on each surface - logically).
Skipping 16 (0-15) surfaces above the 17th (on which the sector is located) =>
= 529229
UPDATE:
The question is not ambiguous but my interpretation was flawed in the sense that the
sectors are not numbered laterally but CROSS-SECTIONALLY across the platters
(rather surfaces).
So the sectors are first numbered sequentially on the 0th cylinder of the 0th surface on
the 1st platter and then the 1st surface (the other recordable end) of the same platter.
Similarly, if the head is on the 1st cylinder => It has skipped the 0th cylinder.
Further, depending on the cylinder position of the head, it can be inferred how many
times, all the 10 platters were skipped.
To make this even more evident and clear, let us rectify the above interpretation.
So, <400,16,29> can still be interpreted as: the head on the 401th cylinder, 17th
surface and the 30th sector on that surface as explained above due to the 0 based
index.
comment
Feedback: Although I appreciate the other answer by @Pragy, it would have been
further appreciated if the interpretation in my answer was corrected instead of a
downvote.. Am I right? :)
+15
Heres the obvious rule:
If you have some approach and wish to discuss it, either open up a new thread, or
drop a comment on the question.
how... 400*20 is giving no. of surfaces... for track why we are not multipling with
1000..then we should multiply with 63....so answer should be...
400*20*1000*63+16*1000*63+29 correct me where i m wrong
When read write head arm is at 400 cylinder it means we have surpassed 400*20*63
as each cylinder has 20 surfaces each containing 63 cylinder in addition to that we are
at 16th track containing 63 sectors each so add 16*63 in addition we have surpassed
total 29 cylinders here that gives 505037
← Prev. Next →
Answer: C
Related questions
GATE2009-52
+21
votes
A hard disk has 63 sectors
per track, 10 platters each
3 with 2 recording surfaces
answers and 1000 cylinders. The
1 address of a sector is given
as a triple ⟨c, h, s⟩, where c
is the cylinder number, h is
the surface number and s is
the sector number. ...
⟨0, 15, 31⟩ ⟨0, 16, 30⟩
⟨0, 16, 31⟩ ⟨0, 17, 31⟩
asked Apr 23, 2016 in Operating System by
jothee Veteran (103k points)
2.6k views
normal
GATE2009-33
+30
votes
The enter_CS() and
leave_CS() functions to
9 implement critical section
answers of a process are realized
2 using test-and-set
instruction as follows: void
enter_CS(X) { while(test-
and-set(X)); } void
leave_CS(X) { X = 0; } In the
above solution, X is a
memory location
associated with ... at the
same time Which of the
above statements are
TRUE? (I) only (I) and (II) (II)
and (III) (IV) only
asked Sep 22, 2014 in Operating System by
Kathleen Veteran (52.1k points)
6.6k views
gate2009 operating-system
process-synchronization normal
GATE2009-32
+18
votes
In the following process
state transition diagram for
3 a uniprocessor system,
answers assume that there are
3 always some processes in
the ready state: Now
consider the following
statements: If a process
makes a transition D , it
would result in another
process making transition
A ... uses non-preemptive
scheduling. Which of the
above statements are
TRUE? I and II I and III II
and III II and IV
asked Sep 22, 2014 in Operating System by
Kathleen Veteran (52.1k points)
2.6k views
gate2009 operating-system
process-schedule normal
GATE2009-31
+15
votes
Consider a disk system
with 100 cylinders. The
2 requests to access the
answers cylinders occur in following
4 sequence:
4, 34, 10, 7, 19, 73, 2,
15, 6, 20
Assuming that the head is
currently at cylinder 50,
what is the time taken to
satisfy all requests if it
takes 1ms ... one cylinder
to adjacent one and
shortest seek time first
policy is used? 95 ms
119 ms 233 ms 276 ms
asked Sep 22, 2014 in Operating System by
Kathleen Veteran (52.1k points)
2.4k views
gate2009 operating-system
disk-scheduling normal
GATE2009-30
+28
votes
Consider a system with 4
types of resources R1 (3
6 units), R2 (2 units), R3 (3
answers units), R4 (2 units). A non-
5 preemptive resource
allocation policy is used. At
any given instance, a
request is not entertained if
it cannot be completely ...
any deadlock Only P1 and
P2 will be in deadlock Only
P1 and P3 will be in
deadlock All three
processes will be in
deadlock
asked Sep 22, 2014 in Operating System by
Kathleen Veteran (52.1k points)
8.1k views
gate2009 operating-system
resource-allocation normal
GATE2009-9, ISRO2016-52
+16
votes
In which one of the
following page replacement
4 policies, Belady's anomaly
answers may occur? FIFO Optimal
6 LRU MRU
asked Sep 22, 2014 in Operating System by
Kathleen Veteran (52.1k points)
3.1k views
gate2009 operating-system
page-replacement normal isro2016
GATE2009-34
+23
votes
A multilevel page table is
preferred in comparison to
2 a single level page table for
answers translating virtual address
7 to physical address
because It reduces the
memory access time to
read or write a memory
location. It helps to reduce
the size of page table ... It is
required by the translation
lookaside buffer. It helps to
reduce the number of page
faults in page replacement
algorithms.
asked Sep 22, 2014 in Operating System by
Kathleen Veteran (52.1k points)
2.9k views
gate2009 operating-system
virtual-memory easy
Send feedback My Marks College Prediction Useful Links FAQ Corrections Discuss
Copyright Request Testimonials My Preferences Chat Logs Chat Badges Search tips
Exam Category Blog Category Blog Tags Privacy
Snow Theme by Q2A Market
Powered by Question2Answer