Step 1: Identify the pattern of the series.
The series is: \( 3, 10, 27, 4, 16, 64, 25, 125 \).
We observe that each term alternates between squares and cubes:
\[
3^2 = 9, \, 2^3 = 8, \, 4^2 = 16, \, 5^3 = 125.
\]
Looking at the fourth term \( 4 \), this does not fit the expected sequence as it should be a square or cube. Hence, \( 4 \) is the wrong term.
Step 2: Conclusion.
The incorrect term in the sequence is \( 4 \), so the correct answer is (C) 4.
What comes next in the series?
\(2, 6, 12, 20, 30, \ ?\)
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.