Step 1: Apply the given information.
- For (A): Using the principle of inclusion-exclusion for sets, we have:
\[
n(X \cap Y) = n(X) + n(Y) - n(X \cup Y) = 17 + 23 - 38 = 2
\]
Hence, \( n(X \cap Y) = 2 \), which corresponds to List-II option IV (2).
- For (B): Since \( n(X) = 28 \) and \( n(Y) = 32 \), the union is:
\[
n(X \cup Y) = n(X) + n(Y) - n(X \cap Y) = 28 + 32 - 10 = 50
\]
Hence, \( n(X \cup Y) = 50 \), which corresponds to List-II option III (50).
- For (C): Since \( n(X) = 10 \), we directly have \( n(X) = 10 \), which corresponds to List-II option I (10).
- For (D): From part (A), we already calculated that \( n(X \cap Y) = 2 \), which corresponds to List-II option II (2).
Step 2: Conclusion.
Thus, the correct matching is:
(A) - (IV), (B) - (III), (C) - (I), (D) - (II).
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.