In the following question, there is a certain relationship between two given words on one side of "::" and one word is given on another side of "::" while another word is to be found from the given options, having the same relation with this word as the words of the given pair bear. Choose the correct option to replace the '?'.
Milk : Emulsion :: Butter : ?
Show Hint
- Aerosol
- Suspension
- Sol
- Gel
The Correct Option is B
Solution and Explanation
Step 1: Analyze the relationship between Milk and Emulsion.
- Milk is an emulsion of fat in water, which is a type of mixture where fat droplets are dispersed in a water-based liquid.
- In a similar way, butter is a type of suspension, where fat is suspended in a liquid.
Step 2: Conclusion.
Therefore, the correct answer is 2. Suspension, as it maintains the same relationship between Milk and Emulsion as Butter and Suspension.
Top Questions on Analogies
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.- Find the missing word (?) which is similar to the given words.
- Door is related to bang in the same way as chain is related to
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
- Choose the most appropriate word to complete the analogy:
Courage : Bravery :: Yearning :
Questions Asked in CUET PG exam
- Which of the following is not the application of Divide and Conquer technique?
- CUET (PG) - 2025
- Algorithms
In C language, mat[i][j] is equivalent to: (where mat[i][j] is a two-dimensional array)
- CUET (PG) - 2025
- Pointers and Arrays
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:
- CUET (PG) - 2025
- Graph Theory
Match LIST-I with LIST-II
Choose the correct answer from the options given below:
- CUET (PG) - 2025
- Graph Theory
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.
- CUET (PG) - 2025
- Scheduling Algorithms