Find the next two terms of the series:
The given series is: \( A, C, F, J, ? \).
(A) O
(B) U
(C) R
(D) V
Choose the correct answer from the options given below:
Step 1: Analyze the series.
The given series is: \( A, C, F, J, ? \). Let's find the pattern in the alphabetical order:
- \( A \to C \to F \to J \). Notice the increase in position: \( A(1), C(3), F(6), J(10) \). The positions increase by 2, 3, and 4, respectively. The next step should be an increase by 5, so the next term is \( J + 5 = O \), and after that, \( O + 6 = U \).
Step 2: Conclusion.
The next two terms are \( O \) and \( U \), making the correct answer 2. (B) and (A) respectively.
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.