Step 1: Reverse the second half of the alphabet.
The second half of the alphabet is:
\[
M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z
\]
Reversing this gives:
\[
Z, Y, X, W, V, U, T, S, R, Q, P, O, N, M
\]
Step 2: Construct the new series.
The modified series becomes:
\[
A, B, C, D, E, F, G, H, I, J, K, L, Z, Y, X, W, V, U, T, S, R, Q, P, O, N, M
\]
Step 3: Find the twelfth letter and the seventh letter to the right of it.
The twelfth letter from the left end is \( L \).
Counting seven letters to the right of \( L \), we get:
\[
Z, Y, X, W, V, U, T
\]
Thus, the seventh letter to the right of \( L \) is \( U \). Therefore, the correct answer is 3. U.
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.