Log In
1 vote

In a running race, Geetha finishes ahead of Shalini and Vani finishes after Aparna. Divya finishes ahead of Aparna. Which of the following is a minimal set of additional information that can determine the winner?

  1. Geetha finishes ahead of Divya and Vani finishes ahead of Shalini.
  2. Aparna finishes ahead of Shalini.
  3. Divya finishes ahead of Geetha.
  4. None of the above.
in Quantitative Aptitude
recategorized by

1 Answer

1 vote
Geeta finishes ahead of Shalini  i.e. $Shalini \rightarrow Geeta$  ....$(i)$

Vaani finishes after Aparna i.e $Vaani \rightarrow Aparna$ .............$(ii)$

Divya finishes ahead of Aparna  i.e. $Aparna \rightarrow Divya$.......$(iii)$

from $(ii)$ and $(iii)$

$Vaani \rightarrow Aparna \rightarrow Divya$ .

So the winner can be either $Geeta$ or $Divya$

In option $C$ it is given Geeta finishes ahead of Divya  i.e. $Divya \rightarrow Geeta$

So Geeta will be the winner.

Hence option $C$ is correct.


We will not use option $A$ as it is mentioned that we need to take minimal set of information to determine the winner.

Related questions

1 vote
2 answers
Akash, Bharani, Chetan and Deepa are invited to a party. If Bharani and Chetan attend, then Deepa will attend too. If Bharani does not attend, then Akash will not attend. If Deepa does not attend, which of the following is true? Chetan does not attend Akash does not attend either (A) or (B) none of the above
asked Sep 13, 2019 in Quantitative Aptitude gatecse 224 views
0 votes
1 answer
A student requests a recommendation letter from a professor. The professor gives three sealed envelopes. Each envelope contains either a good recommendation letter or a bad recommendation letter. Make a list of all the possible scenarios. Suppose now the professor tells the ... true and the other two are false. Can the student find out the contents of the envelopes without breaking their seals?
asked Sep 13, 2019 in Quantitative Aptitude gatecse 95 views
2 votes
3 answers
Which of the words below matches the regular expression $a(a+b)^{\ast}b+b(a+b)^{\ast}a$? $aba$ $bab$ $abba$ $aabb$
asked Sep 13, 2019 in Theory of Computation gatecse 433 views
5 votes
2 answers
Let $G=(V, E)$ be an undirected simple graph, and $s$ be a designated vertex in $G.$ For each $v\in V,$ let $d(v)$ be the length of a shortest path between $s$ and $v.$ For an edge $(u,v)$ in $G,$ what can not be the value of $d(u)-d(v)?$ $2$ $-1$ $0$ $1$
asked Sep 13, 2019 in Graph Theory gatecse 219 views