# GATE1998-17

1 vote
1.3k views
Calculate the total time required to read 35 sectors on a 2-sided floppy disk. Assume that each track has 8 sectors and the track-to-track step time is 8 milliseconds. The first sector to be read is sector 3 on track 10. Assume that the diskette is soft sectored and the controller has a 1-sector buffer. The diskette spins at 300 RPM and initially, the head is on track 10.

retagged
0
Is it out of syllabus?
0
this question does not specify the location of  35 sectors where to read from?

if we assume the time to read  a sector is 1/40 sec

then total time taken  assuming that 35 sectors are distributed somewhat evenly is 8*5 millisec +35/40sec

The diskette spins at 300 RPM and initially

so 300 rpm -->

1 track =1/300 minute

=60/300 seconds

=1/5 seconds

so one sector =1/40 seconds

now given that 35 sector and started from the sector 3 on track 10th

so the distribution of sector which we have to read  is    6,8,8,8,5

means first we read 6 sector of track 10th

after that 8 sector track 11th

after that 8 sector track 12th

after that 8 sector track 13th

after that 5 sector track 14th

Given:the track-to-track step time is 8 milliseconds

we have to read the data from the 5 track (that is 6,8,8,8,5)

so total time to move from one track to another for these five track =4*8 milliseconds=32ms

and total time to read 35 sectors =35/40 s=35000/40 ms=875 ms

so total time=875+32=907 ms

edited
0
What is 6,8,8,8,5 in your solution and how it came
0

we have to read the data from the five track that is 6,8,8,8,5

because we have total 35 sector which we have to read and starting is from 3rd sector of 10th track

so first we read 6 sector of track 10th

after that 8 sector track 11th

after that 8 sector track 12th

so on

at the end we left only 5 sector

1

@Satbir

@Lakshman Patel RJIT

@techbd123

@srestha ma'am

Should we go through this question for GATE purpose & if we should Can you verify the given solution.

1
Why average latency is not cosidered?? As we have to first move to sector 3 on the track 10.
Arjun Sir need answer for the above questions
0
What about overhead of controller ( 1 sector delay ) & rotational latency ?

## Related questions

1
3.5k views
Formatting for a floppy disk refers to arranging the data on the disk in contiguous fashion writing the directory erasing the system data writing identification information on all tracks and sectors
2
912 views
Consider a disk with $c$ cylinders, $t$ tracks per cylinder, $s$ sectors per track and a sector length $s_l$. A logical file $d_l$ with fixed record length $r_l$ is stored continuously on this disk starting at location $(c_L, t_L, s_L)$ ... . Derive the formula to calculate the disk address (i.e. cylinder, track and sector) of a logical record n assuming that $r_l=s_l$.
3
2.1k views
Free disk space can be used to keep track of using a free list or a bit map. Disk addresses require $d$ bits. For a disk with $B$ blocks, $F$ of which are free, state the condition under which the free list uses less space than the bit map.
Consider $n$ processes sharing the CPU in a round-robin fashion. Assuming that each process switch takes $s$ seconds, what must be the quantum size $q$ such that the overhead resulting from process switching is minimized but at the same time each process is guaranteed to get its turn at the CPU at least every $t$ ... $q \geq \frac{t-ns}{n-1}$ $q \leq \frac{t-ns}{n+1}$ $q \geq \frac{t-ns}{n+1}$