All Exams Test series for 1 year @ ₹349 only
Question

In a certain code language, ‘DRAWN’ is coded as '25761' and 'WARNE' is coded as '57264'. What is the code for ‘E' in the given code language?

The correct answer is

4

Understanding Code Language Puzzles

This question is a classic example of a coding-decoding puzzle often found in logical reasoning sections of competitive exams. In these puzzles, words are coded using numbers, symbols, or other letters based on a specific rule. The task is to decipher this rule and apply it to find the code for another word or letter.

Here, we are given two examples of words coded into digits:

  • 'DRAWN' is coded as '25761'
  • 'WARNE' is coded as '57264'

We need to find the code for the letter 'E'.

Analyzing the Given Codes for Mapping

Let's look at the letters present in both words and their corresponding digits in the given codes:

  • Letters in DRAWN: D, R, A, W, N
  • Digits in 25761: 2, 5, 7, 6, 1
  • Letters in WARNE: W, A, R, N, E
  • Digits in 57264: 5, 7, 2, 6, 4

We can try to find a pattern or a consistent mapping between letters and digits.

Initial Positional Assumption Check

A common type of code is a simple positional substitution where the first letter maps to the first digit, the second to the second, and so on.

From 'DRAWN' (25761), a positional mapping would suggest:

  • D <=> 2
  • R <=> 5
  • A <=> 7
  • W <=> 6
  • N <=> 1

From 'WARNE' (57264), a positional mapping would suggest:

  • W <=> 5
  • A <=> 7
  • R <=> 2
  • N <=> 6
  • E <=> 4

Identifying the Consistent Mapping

Let's compare the proposed mappings for the letters common to both words (W, A, R, N):

Letter Mapping from DRAWN (Positional) Mapping from WARNE (Positional) Consistency
W 6 5 Inconsistent
A 7 7 Consistent
R 5 2 Inconsistent
N 1 6 Inconsistent

We observe that only the letter 'A' has a consistent mapping (A <=> 7) based on its position in both words. This suggests the code is not strictly positional for all letters in both words, but there might be a fixed substitution for each letter.

Deriving the Fixed Letter-to-Digit Mapping

Let's assume there is a fixed digit for each letter, and the given codes are simply the collection of these digits for the letters in the word, possibly in a specific order.

Letters in DRAWN: {D, R, A, W, N}. Set of digits in 25761: {1, 2, 5, 6, 7}.

Letters in WARNE: {W, A, R, N, E}. Set of digits in 57264: {2, 4, 5, 6, 7}.

Common letters: {W, A, R, N}. Common digits: {2, 5, 6, 7}.

Unique letter in DRAWN: D. Unique digit in {1, 2, 5, 6, 7} not in {2, 4, 5, 6, 7}: 1. This suggests D <=> 1.

Unique letter in WARNE: E. Unique digit in {2, 4, 5, 6, 7} not in {1, 2, 5, 6, 7}: 4. This suggests E <=> 4.

We also saw from positional checking that A <=> 7 is consistent.

Let's verify if these partial mappings (D=1, A=7, E=4) work with the remaining letters {W, R, N} and digits {2, 5, 6}.

  • For DRAWN (25761): Letters {D, R, A, W, N}. Digits {1, 2, 5, 6, 7}. Using our map, this set is {1, R, 7, W, N}. The remaining digits for {R, W, N} are {2, 5, 6}.
  • For WARNE (57264): Letters {W, A, R, N, E}. Digits {2, 4, 5, 6, 7}. Using our map, this set is {W, 7, R, N, 4}. The remaining digits for {W, R, N} are {2, 5, 6}.

We need to assign 2, 5, and 6 to W, R, and N consistently.

Look back at the positional mappings:

  • From DRAWN: R=5, W=6, N=1 (but we found D=1). Rechecking the digits 2,5,7,6,1 against letters D,R,A,W,N means: {D,R,A,W,N} maps to {2,5,7,6,1}. If D=1, A=7, then {R,W,N} map to {2,5,6} from the original list, in some order. The digits given for R,W,N are 5,6,1. If D=1, then R=5, W=6, and N must correspond to 2. So maybe R=5, W=6, N=2? This contradicts the positional map for N=1.
  • From WARNE: W=5, A=7, R=2, N=6, E=4. This matches our findings for A and E (A=7, E=4). Let's see if W=5, R=2, N=6 works for the other word.

Confirming the Fixed Mapping

Let's test the complete mapping derived from WARNE and the unique letters/digits:

  • D <=> 1 (from unique letter/digit)
  • E <=> 4 (from unique letter/digit)
  • A <=> 7 (from positional consistency)
  • W <=> 5 (from WARNE positional)
  • R <=> 2 (from WARNE positional)
  • N <=> 6 (from WARNE positional)

Let's check if the set of codes derived from this fixed mapping matches the set of digits in 'DRAWN' (25761):

  • D <=> 1
  • R <=> 2
  • A <=> 7
  • W <=> 5
  • N <=> 6

The set of codes for DRAWN is {1, 2, 7, 5, 6}. The set of digits in 25761 is {1, 2, 5, 6, 7}. The sets match. This confirms our derived fixed mapping is consistent with both coded words.

The fixed mapping is:

Letter Code
D 1
R 2
A 7
W 5
N 6
E 4

Note that the code for 'WARNE' (57264) exactly matches the order of the fixed codes for its letters (W=5, A=7, R=2, N=6, E=4). The code for 'DRAWN' (25761) uses the same set of codes for its letters (D=1, R=2, A=7, W=5, N=6), but the digits are arranged in a different order (D-2, R-5, A-7, W-6, N-1 based on the initial positional analysis which proved inconsistent for most letters).

The intended rule seems to be a fixed substitution for each letter, and the code '57264' for 'WARNE' provides the letters W, A, R, N, E and their fixed codes in the correct sequence.

Finding the Code for 'E'

Based on our consistent fixed mapping, the code for 'E' is 4.

The question asks for the code for 'E'. From the word 'WARNE' and its code '57264', and confirming with the consistent mapping, the code for 'E' is 4.

Conclusion on Code for E

By analyzing the given codes and letters, we deduced a fixed mapping for each letter. The letter 'E' maps to the digit 4.

The final answer is 4.

Revision Table: Key Concepts

Concept Description
Coding-Decoding Reasoning puzzles involving rules to convert information (like words) into codes.
Substitution Cipher A method where each unit (like a letter) is replaced by another unit (like a digit).
Positional Coding Coding where the code unit depends on the original unit's position.
Fixed Substitution Coding where each original unit always maps to the same code unit, regardless of position.

Additional Information on Logical Coding

Coding-decoding problems test your ability to identify patterns and rules. Rules can be varied, including:

  • Letter to Number: Assigning numerical values based on alphabetical position (A=1, B=2, etc.) or other patterns.
  • Letter to Letter: Replacing letters with other letters (e.g., shifting letters by a fixed number of positions in the alphabet).
  • Letter to Symbol: Using symbols instead of letters or numbers.
  • Word to Word: Coding a word based on properties like the number of letters, vowels/consonants, or more complex patterns.
  • Word to Number/Symbol: The type seen in this problem, where a word is represented by a sequence of digits or symbols.

When solving these problems, always look for common elements (letters, positions, digits) and inconsistencies to eliminate possible rules and identify the correct logic. Sometimes, only part of the information is needed to answer the specific question, as seen here where focusing on 'WARNE' and confirming with 'DRAWN' helped establish the fixed code for 'E'.

Was this answer helpful?

Important Questions from Coding Decoding Based on Numbers

  1. In a certain code language, ‘CROW’ is coded as ‘64’ and ‘EAGLE’ is coded as ‘125’. How will ‘PARROT’ be coded in that language?

  2. In a certain code language, ‘AROUND’ is coded as ‘52182412144’ and ‘FIX’ is coded as ‘63624’. How will ‘PLASTIC’ be coded in that language?

  3. If POSTER is coded as 592314 and DARK is coded as 8647, then how will STROKE be coded as?

  4. In a certain code language, ‘POUND’ is coded as ‘106’ and ‘CLEAN’ is coded as ‘41’. How will ‘MAKER’ be coded as in that language?

  5. In a certain code language, 'CURD' is written as '342184' and 'BREAD' is written as '2181024'. How will 'BUTTER' be written in that language?

Need Expert Advice?

Start Your Preparation with Prepp Mobile App

Download the app from Google Play & App Store
Download the app from Google Play & App Store
Prepp Mobile App