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

This topic has expert replies
Post new topic Post Reply
Previous Topic Next Topic
Master | Next Rank: 500 Posts
Posts: 109
Joined: Sun May 10, 2009 7:53 am

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

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
Top
Source: — Data Sufficiency |
Senior | Next Rank: 100 Posts
Posts: 65
Joined: Thu Jul 02, 2009 10:38 pm
Location: Bangalore
Thanked: 1 times

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
Top
Post new topic Post Reply
• Page 1 of 1