BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

In a certain coding scheme, each word is encoded by replacin

Expert replies
by sanjib » Sun Sep 06, 2009 3:08 am
In a certain coding scheme, each word is encoded by replacing each letter in the word with another letter. The same code is used for all words, so that the same letter replaces a given letter each time the given letter occurs. What code will result when the word TAME is encoded by this scheme?
(1) When the word MAT is encoded, the result is DLX.
(2) When the word TEA is encoded, the result is XRL.
Please need professional help
Join the discussion
Source: — Data Sufficiency |

by engg.manik » Sun Sep 06, 2009 4:13 am
In a certain coding scheme, each word is encoded by replacing each letter in the word with another letter. The same code is used for all words, so that the same letter replaces a given letter each time the given letter occurs. What code will result when the word TAME is encoded by this scheme?
(1) When the word MAT is encoded, the result is DLX.
(2) When the word TEA is encoded, the result is XRL.

SOLUTION :-

Statement 1 Replacement of M --> D, A --> L T --> X
So in TAME , only E is not known.

So answer can be C or E

Statement 2 Replacement of T --> X, E --> R, A --> L
So in TAME only M is not known.

But joining I & II

TAME ---> XLDR

Sp correct answer is C
Join the discussion