[Solved] Access to moving head disks requires three periods of delay before information is brought into memory. The response that correctly lists the three time delays for the physical access of data in the order of the relative speed from the slowest to the fastest is

Q.	Access to moving head disks requires three periods of delay before information is brought into memory. The response that correctly lists the three time delays for the physical access of data in the order of the relative speed from the slowest to the fastest is
A.	latency time, cache overhead time, seek time
B.	transmission time, latency time, seek time
C.	seek time, latency time, transmission time
D.	cache overhead time, latency time, seek time
Answer» C. seek time, latency time, transmission time

4.1k

Do you find this helpful?

View all MCQs in

Operating System Advanced

Discussion

No comments yet

Related MCQs

Match the following pairs A. Logical address(1) An actual location in main memory B. Relative address (2) An address is expressed as a location relative to some known point. C. Physical address (3) A memory location independent of the current assignment of data to memory
A-Fixed-Head disk, B-Movable-Head disk, 1- One head per track and al head are mounted on rigid arm that extends across all tracks. 2- Only one head and head is mounted on the arm, such that it can position the track.
In uni-processor scheduling :A : Turnaround time, B : Response time, 1: A time interval between the submission of a process and its completion. 2: For interactive process, it is a time from the submission of a request until the response begins to received. 3: It includes actual execution time plus time spent waiting for resources.
Match the following in RAID scheme : A- Parallel access array, B-Independent access array, 1- All member disks participate in the execution of every I/O request. 2- Each member disk participates separately in the execution of every I/O request. 3- Here spindles of the individual drives are synchronized so that each disk head is in the same position on each disk at any given time.
In memory management : A- Fetch Policy B- Cleaning Policy C- Placement Policy: 1- It determines when a modified page should be written out to secondary memory. 2- It determines when a page should be bought into main memory. 3- It determines where in real memory a process piece is to be reside.
Statement A : In memory management, the replacement policy deals with the selection of pages in memory to be replaced by arrived new page. Statement B: In memory management, the policy the fetch policy determines when a page should be bought into main memory.
A. Absolute Loading B. Relocatable Loading C. Dynamic Run-Time Loading; 1- It requires that a load module always be loaded into some location in main memory. 2- A load module can be located anywhere in main memory.
RAID-O does not support the following characteristics: A: RAID is a set of physical disk drives viewed by the operating system as a single logical drive. B: Data distributed across the physical drives of an array. C: Re- demdant disk capacity is used to store parity information, which guarantees data recoverability in case of a disk failure.
A Absolute loading B Re-locatable loading C Dynamic Run-Time loading; 1. For loader, load module, either is an absolute main memory address or specific address reference. 2. For loader, load modules have no absolute address. 3. For loader, load modules have all memory reference in relative form.
The RAID (Redundant Array of Independent Disks) level one requires