Home » Data Interpretation » Data Sufficiency

Coding — How is 'never' written in the code language? Statements: I. 'never ever go there' → 'na ja ni ho'. II. 'go there and come back' → 'ma ho sa ni da'.

Difficulty: Medium

Statement I alone is sufficient; Statement II alone is not sufficient.
Statement II alone is sufficient; Statement I alone is not sufficient.
Either Statement I alone or Statement II alone is sufficient.
Both Statements I and II together are not sufficient.
Both Statements I and II together are sufficient, but neither alone is sufficient.

Correct Answer: Both Statements I and II together are not sufficient.

Explanation:

Introduction / Context:
We must identify the unique code token for the English word 'never' via overlapping coded sentences.

Given Data / Assumptions:

S1: 'never ever go there' ↔ {na, ja, ni, ho}.
S2: 'go there and come back' ↔ {ma, ho, sa, ni, da}.
One-to-one mapping per sentence; tokens are word-level.

Concept / Approach:
Intersect common words and codes to eliminate shared pairs; leftover tokens in S1 would correspond to {never, ever} but remain ambiguous.

Step-by-Step Solution:

Common English words across S1 and S2: {go, there}. Common codes: {ni, ho} (order unknown).Removing these from S1 leaves {na, ja} mapping to {never, ever}, which cannot be distinguished without an additional sentence containing exactly one of {never, ever}.

Verification / Alternative check:
No arrangement of the S2 tokens resolves the tie between {na, ja}.

Why Other Options Are Wrong:

A/B/C/E: Neither statement alone nor both together can uniquely assign 'never'.

Common Pitfalls:
Assuming alphabetical/semantic hints; DS forbids using such external cues.

Coding — How is 'never' written in the code language? Statements: I. 'never ever go there' → 'na ja ni ho'. II. 'go there and come back' → 'ma ho sa ni da'.

More Questions from Data Sufficiency

Discussion & Comments