Question 1

Computer Awareness Computer memory Easy

Match List-I with List-II $$ \begin{array}{|c|l|} \hline \textbf{List-I} & \textbf{List-II} \\ \hline (A)\ \text{Seek Time} & (I)\ \text{Total number of bytes transferred,} \\ & \ \ \ \text{divided by the total time} \\ & \ \ \ \text{between the first request for service} \\ & \ \ \ \text{and the completion of the last transfer} \\ \hline (B)\ \text{Access Time} & (II)\ \text{Time taken for the disk} \\ & \ \ \ \text{to rotate the desired sector} \\ & \ \ \ \text{to the disk head} \\ \hline (C)\ \text{Rotational Latency} & (III)\ \text{Seek Time + Rotational Latency} \\ \hline (D)\ \text{Disk Bandwidth} & (IV)\ \text{Time taken for the disk arm} \\ & \ \ \ \text{to move the heads} \\ & \ \ \ \text{to the cylinder} \\ & \ \ \ \text{containing the desired sector} \\ \hline \end{array} $$

(A) (A)-(I), (B)-(II), (C)-(III), (D)-(IV)
(B) (A)-(II), (B)-(III), (C)-(II), (D)-(IV)
(C) (A)-(II), (B)-(III), (C)-(IV), (D)-(I)
(D) (A)-(IV), (B)-(III), (C)-(II), (D)-(I)
✓ Correct Answer: Option D Verified Solution

📘 Step-by-Step Solution & Detailed Explanation:

Explanation:

(A) Seek Time: Time taken for the disk arm to move the heads to the cylinder containing the desired sector.
  ⇒ (A) → (IV)

(B) Access Time: Seek Time + Rotational Latency.
  ⇒ (B) → (III)

(C) Rotational Latency: Time taken for the disk to rotate the desired sector to the disk head.
  ⇒ (C) → (II)

(D) Disk Bandwidth: Total bytes transferred divided by total time between the first request and completion of last transfer.
  ⇒ (D) → (I)

∴ Correct matching is: (A)-(IV), (B)-(III), (C)-(II), (D)-(I)

Practice Similar Computer memory Questions

Reinforce your conceptual grasp with related questions from CUET-MCA 2025:

Q30 Consider the following type of memories. (A). Hard Disk Drive (HDD) (B)....
Solve →
Q43 To provide a memory capacity of 32K X 16 how many address lines and data...
Solve →
Q4 In case of Binary search tree which of the following procedure's running...
Solve →
Q7 External fragmentation occurs
Solve →
Q9 In the search time is independent of the number of elements n.
Solve →
Full-Length Test Series

Prepare for CUET-MCA Under Real Exam Conditions

Take timed full-length mock tests with authentic question distributions, negative marking (+12/-3 in Math), and instant All India Rank calculation.

Start Free Mock Test Series →