Step 1: Definition of Terms.
- **Seek Time** (A): Time taken by the disk arm to move to the desired cylinder.
- **Access Time** (B): The total time taken to access a disk sector, including both seek time and rotational latency.
- **Rotational Latency** (C): The time taken for the disk to rotate and align the desired sector under the disk head.
- **Disk Bandwidth** (D): The rate at which data can be read or written from/to the disk.
Step 2: Match each term with the corresponding feature.
- **Seek Time** corresponds to **(IV)**, which is the time taken for the disk arm to move to the required cylinder.
- **Access Time** corresponds to **(III)**, which is the sum of seek time and rotational latency.
- **Rotational Latency** corresponds to **(II)**, which is the time for the disk to rotate the desired sector under the head.
- **Disk Bandwidth** corresponds to **(I)**, which refers to the rate of transfer of data.
Step 3: Conclusion.
The correct matching is **(A) - (I), (B) - (II), (C) - (III), (D) - (IV)**.
In C language, mat[i][j] is equivalent to: (where mat[i][j] is a two-dimensional array)
Suppose a minimum spanning tree is to be generated for a graph whose edge weights are given below. Identify the graph which represents a valid minimum spanning tree?
\[\begin{array}{|c|c|}\hline \text{Edges through Vertex points} & \text{Weight of the corresponding Edge} \\ \hline (1,2) & 11 \\ \hline (3,6) & 14 \\ \hline (4,6) & 21 \\ \hline (2,6) & 24 \\ \hline (1,4) & 31 \\ \hline (3,5) & 36 \\ \hline \end{array}\]
Choose the correct answer from the options given below:
Match LIST-I with LIST-II
Choose the correct answer from the options given below:
Consider the following set of processes, assumed to have arrived at time 0 in the order P1, P2, P3, P4, and P5, with the given length of the CPU burst (in milliseconds) and their priority:
\[\begin{array}{|c|c|c|}\hline \text{Process} & \text{Burst Time (ms)} & \text{Priority} \\ \hline \text{P1} & 10 & 3 \\ \hline \text{P2} & 1 & 1 \\ \hline \text{P3} & 4 & 4 \\ \hline \text{P4} & 1 & 2 \\ \hline \text{P5} & 5 & 5 \\ \hline \end{array}\]
Using priority scheduling (where priority 1 denotes the highest priority and priority 5 denotes the lowest priority), find the average waiting time.