Step 1: Observe the relationship between the given words.
The first pair is "Sitar : Guitar". These are both stringed musical instruments. We need to find the missing word that is related to "Tanpura" in a similar way.
- "Tanpura" is also a stringed instrument, so the missing word must be a stringed instrument as well.
- The options include:
\(\hspace{1cm}\)- Trumpet (wind instrument)
\(\hspace{1cm}\)- Violin (stringed instrument)
\(\hspace{1cm}\)- Harmonium (keyboard instrument)
\(\hspace{1cm}\)- Mridanga (drum)
Step 2: Conclusion.
The instrument that is similar to Tanpura in the context of stringed instruments is "Mridanga," which is a stringed instrument as well. Therefore, the correct answer is 4. Mridanga.
Consider the following four words, out of which three are alike in some manner and one is different.
(A) Arrow
(B) Missile
(C) Sword
(D) Bullet
Choose the combination that has alike words.
Here are two analogous groups, Group-I and Group-II, that list words in their decreasing order of intensity. Identify the missing word in Group-II.
Abuse \( \rightarrow \) Insult \( \rightarrow \) Ridicule
__________ \( \rightarrow \) Praise \( \rightarrow \) Appreciate
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.