Coding — How is 'must' written in the code language? Statements: I. 'you must see' → 'la pa ni' and 'did you see' → 'jo ni pa'. II. 'you did that' → 'pa si jo'.

Difficulty: Medium

Correct Answer: Statement I alone is sufficient; Statement II alone is not sufficient.

Explanation:


Introduction / Context:
Determine the unique code for the word 'must' from coded sentences.


Given Data / Assumptions:

  • S1: 'you must see' ↔ {la, pa, ni}.
  • S2: 'did you see' ↔ {jo, ni, pa}.
  • S3 (II): 'you did that' ↔ {pa, si, jo}.


Concept / Approach:
Use overlaps to isolate the remaining token corresponding to 'must'.


Step-by-Step Solution:

Common words between S1 and S2: {you, see}. Their common codes: {pa, ni}. Therefore, in S1, 'must' must map to the leftover token 'la'.Statement I alone is enough to deduce this; Statement II only confirms mappings of 'you' and 'did' but is not needed to identify 'must'.


Verification / Alternative check:
Any reassignment contradicts the bijection within S1 and the overlap with S2.


Why Other Options Are Wrong:

  • II alone: Does not include 'must'; cannot isolate it.
  • Either alone / Both together not sufficient / Both together sufficient: inconsistent with the deduction above.


Common Pitfalls:
Assuming fixed token ordering; overlooking that the intersection {you, see} pins two codes, leaving 'la' for 'must'.


Final Answer:
Statement I alone is sufficient; 'must' = 'la'.

More Questions from Data Sufficiency

Discussion & Comments

No comments yet. Be the first to comment!
Join Discussion