Skip to content
Official PYQ · 2009

GATE CS 2009 Q52 — I/O Scheduling

Explain with AI

A hard disk has 6363 sectors per track, 1010 platters each with 22 recording surfaces and 10001000 cylinders. The address of a sector is given as a triple ⟨c,h,s⟩\langle c, h, s \rangle, where cc is the cylinder number, hh is the surface number and ss is the sector number. Thus, the 0th^{th} sector is addresses as ⟨0,0,0⟩\langle 0, 0, 0 \rangle, the 1st^{st} sector as ⟨0,0,1⟩\langle 0, 0, 1 \rangle, and so on

The address of the 1039th^{th} sector is

Choose one option
View worked solution

Answer: C

To find the address of the 1039th1039^{\text{th}} sector, we first understand the disk geometry and how the sector addresses are mapped.

1. Given Parameters

  • Sectors per track (SS): 6363
  • Number of surfaces/heads (HH): 10 platters×2 surfaces/platter=2010 \text{ platters} \times 2 \text{ surfaces/platter} = 20
  • Number of cylinders (CC): 10001000

2. Sector Mapping Formula

The sectors are indexed sequentially starting from 00. For a given linear sector index NN, the physical address ⟨c,h,s⟩\langle c, h, s \rangle is determined as follows:

  • Sectors per cylinder: H×S=20×63=1260H \times S = 20 \times 63 = 1260
  • Cylinder (cc): c=⌊N/(H×S)⌋c = \lfloor N / (H \times S) \rfloor
  • Surface (hh): h=⌊(N mod (H×S))/S⌋h = \lfloor (N \bmod (H \times S)) / S \rfloor
  • Sector (ss): s=N mod Ss = N \bmod S

3. Calculation for the 1039th1039^{\text{th}} Sector (N=1039N = 1039)

  • Cylinder (cc): c=⌊10391260⌋=0c = \left\lfloor \frac{1039}{1260} \right\rfloor = 0
  • Remaining sectors within the cylinder: 1039 mod 1260=10391039 \bmod 1260 = 1039
  • Surface (hh): h=⌊103963⌋=16(since 16×63=1008)h = \left\lfloor \frac{1039}{63} \right\rfloor = 16 \quad (\text{since } 16 \times 63 = 1008)
  • Sector (ss): s=1039 mod 63=1039−1008=31s = 1039 \bmod 63 = 1039 - 1008 = 31

Thus, the address of the 1039th1039^{\text{th}} sector is ⟨0,16,31⟩\langle 0, 16, 31 \rangle.

Free practice · Your answers on this page are not saved.

Published
Report a correction
Keep exploringMore I/O Scheduling questions