Step 1: Understanding the sections.
- **Critical section** (C): This is the section where the process accesses shared resources.
- **Entry section** (A): This is the section before the critical section, where the process requests entry.
- **Remainder section** (B): The section after the critical section, where the process releases the resource and performs other tasks.
- **Exit section** (D): This section handles the exit process from the critical section.
Step 2: Arrange the sections correctly.
To form a valid structure for a process in the critical section:
- The process first enters the **Entry section** (A), checks for any conditions (if needed), and then moves to the **Critical section** (C).
- After completing its task in the **Critical section**, the process moves to the **Exit section** (D) to release the resource.
- Finally, the process moves to the **Remainder section** (B) for other tasks.
Step 3: Conclusion.
The correct order of statements is **(C), (B), (A), (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.