Step 1: Understand the layers of MS-DOS.
The layers of the MS-DOS operating system can be arranged in the following order starting from the innermost to the outermost:
- **(A) ROM BIOS Device Drivers**: These are the lowest level of the system and interact directly with the hardware. They are part of the ROM (Read-Only Memory).
- **(C) MS-DOS Device Drivers**: These drivers are used to control the system's devices and interact with the hardware through the ROM BIOS.
- **(B) Resident System Program**: This program is loaded into memory during the boot process and manages system functions like file handling, memory management, etc.
- **(D) Application Program**: This is the highest layer and refers to user programs or software that interact with the operating system to perform tasks.
Step 2: Conclusion.
The correct order of layers is **(A), (C), (B), (D)**.
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.