Question
Consider the following statements relating to the level of poker play of four players P, Q, R and S.
I. P always beats Q
II. R always beats S
III. S loses to P only sometimes
IV. R always loses to Q
Which of the following can be logically inferred from the above statements?
(i) P is likely to beat all the three other players
(ii) S is the absolute worst player in the set
Official answer and solution
- Official answer
- D
- From
- Official GATE 2016 answer key
Solution
Evaluate the transitive and intransitive relationships given by the four poker statements.
List the pairwise relationship facts:
- Statement I: always beats ()
- Statement II: always beats ()
- Statement IV: always loses to , meaning always beats ()
Combining these three: beats , beats , and beats ( in deterministic pairwise matchups).
Now examine Statement III: 'S loses to P only sometimes'.
This means that does not always lose to ; in fact, wins against at least some of the time (or even most of the time).
Because can beat , the relation is not strictly transitive across the set of players:
- (i) 'P is likely to beat all the three other players' cannot be inferred because does not reliably beat .
- (ii) 'S is the absolute worst player in the set' cannot be inferred because beats (who beats everyone else in direct matches) a significant portion of the time.
Therefore, neither (i) nor (ii) can be logically inferred.
D
Assuming transitivity from and ignoring Statement III which introduces an intransitive loop where defeats .
The answer is the one in the official GATE answer key. The solution is this site's own explanation.
Source
- Paper
- GATE 2016 Computer Science and Information Technology (CS) Session 1
- Question
- 8 of 65, printed as GA Q.8
- Section
- General Aptitude
Report an error in this question
GATE questions are the work of the organising institutes. This site is independent and is not affiliated with them.