In a certain code language, ‘ACTION’ is written as ‘DFWFLK’ and ‘BISHOP’ is written as ‘ELVELM’. How will ‘MATTER’ be written in that language?
PDWQBO
This question involves a coding-decoding problem where words are transformed into a code based on a specific pattern. We are given two examples: 'ACTION' coded as 'DFWFLK' and 'BISHOP' coded as 'ELVELM'. Our task is to decipher the underlying rule and apply it to find the code for 'MATTER'.
Let's compare the letters of the original words with their corresponding coded letters:
| Original Word | Coded Word | Letter by Letter Transformation |
|---|---|---|
| A | D | A → D |
| C | F | C → F |
| T | W | T → W |
| I | F | I → F |
| O | L | O → L |
| N | K | N → K |
Let's look at the positional changes in the alphabet:
It appears the first three letters of 'ACTION' are shifted forward by 3 positions (\(\text{letter} + 3\)), and the last three letters are shifted backward by 3 positions (\(\text{letter} - 3\)).
Let's check if the same pattern applies to 'BISHOP' and 'ELVELM'.
| Original Word | Coded Word | Letter by Letter Transformation |
|---|---|---|
| B | E | B → E (\(2 \to 5\), \(+3\)) |
| I | L | I → L (\(9 \to 12\), \(+3\)) |
| S | V | S → V (\(19 \to 22\), \(+3\)) |
| H | E | H → E (\(8 \to 5\), \(-3\)) |
| O | L | O → L (\(15 \to 12\), \(-3\)) |
| P | M | P → M (\(16 \to 13\), \(-3\)) |
The pattern holds true for 'BISHOP' as well: the first three letters are shifted by \(+3\) and the last three letters by \(-3\).
Now we apply this logical rule to the word 'MATTER'. 'MATTER' has 6 letters. The first three letters are M, A, T and the last three are T, E, R.
Combining the coded letters, 'MATTER' is coded as 'PDWQBO'.
Let's compare our result 'PDWQBO' with the given options:
Our derived code 'PDWQBO' matches Option 4.
The pattern observed in the coding language is a simple shift cipher applied to two halves of the word separately. The first half undergoes a \(+3\) shift, and the second half undergoes a \(-3\) shift. Applying this to 'MATTER' gives us the code 'PDWQBO'.
| Original Word | Pattern Applied | Coded Word |
|---|---|---|
| A C T | I O N | \(+3\) \(+3\) \(+3\) | \(-3\) \(-3\) \(-3\) | D F W | F L K |
| B I S | H O P | \(+3\) \(+3\) \(+3\) | \(-3\) \(-3\) \(-3\) | E L V | E L M |
| M A T | T E R | \(+3\) \(+3\) \(+3\) | \(-3\) \(-3\) \(-3\) | P D W | Q B O |
Coding-decoding questions are common in reasoning tests. They assess your ability to identify patterns and logical rules. Here are some common types:
Solving these problems requires careful observation, analyzing the relationship between the original word and the coded word, and systematically testing potential patterns like letter shifts, reversals, or substitutions.
In a certain code language, 'INERTIA' is written as 'RGVKGBZ'. How will 'FLOWER' be written in that language?
In a certain code language, ‘ADVANCE’ is written as ‘VDAAECN’ and ‘BABYSIT’ is written as ‘BABYTIS’. How will ‘AFFABLE’ be written in that language?
In a certain language, CHHAPAK is coded as DJKEUGR. How will MALANGA be coded in that language?
In a certain code language, ‘DURABLES’ is written as ‘BSVETFMC’. How will ‘FEASIBLE’ be written in that language?
In a certain code language, 'FIXED' is written as 'XIFED' and 'MOUSE' is written as 'USOME'. How will 'GAMBIT' be written in that language?