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 » Fri Sep 04, 2009 8:03 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 |
Newbie | Next Rank: 10 Posts
Posts: 5
Joined: Thu Apr 23, 2009 3:05 am
Location: Toronto, Canada

by eric.gordon884 » Sun Sep 06, 2009 6:41 am
This strikes me as simple decoder ring stuff - each letter is replaced by a fixed corresponding letter. The trick is to find out which is which.

To encode the word TAME, you need to know the corresponding letters for T, A, M, and E.

(i) only provides the letters M(->D), A(->L), and T(->X). You cannot encode TAME because you don't know what E is.

(ii) only provides the letters T(->X), E(->R), and A(->L). You cannot encode TAME because you don't know what M is.

(i)+(ii) you have all letters and can encode TAME -> XLDR.

The answer is C.
Top
Master | Next Rank: 500 Posts
Posts: 109
Joined: Sun May 10, 2009 7:53 am

by sanjib » Sun Sep 06, 2009 12:18 pm
Right ,thank you . The OA is C
Top
Post new topic Post Reply
• Page 1 of 1