Step 1: Analyze each number series.
- (A) \( D4, F6, H8, J10, ? \): The letters follow a pattern: D (4), F (6), H (8), J (10), and the next letter is L with the number 12. Therefore, this matches with List-II option IV (L12).
- (B) \( 2B, 4C, 8E, 14H, ? \): The numbers double each time (2, 4, 8, 14...), and the corresponding letter positions increase in a similar fashion (B, C, E, H...). The next number is 28 and the letter is L, matching with List-II option II (111).
- (C) \( 3F, 6G, ?, 18L, 27P \): Here, the number doubles (3, 6, 12, 18...) and the letters follow the alphabetical order (F, G, I, L, P...). The missing term is 12 and the letter is I, which corresponds to List-II option III (22L).
- (D) \( W144, S100, Q81, O64 \): The numbers decrease by a fixed pattern: 144, 100, 81, 64... The next term is 49 with the letter M, corresponding to List-II option I (U121).
Step 2: Conclusion.
Thus, the correct matching is:
(A) - (IV), (B) - (II), (C) - (III), (D) - (I).
Find the missing letter:
CUBAEDEDABEBBAUCDBCADB
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.