In a code language, 'PARUL' is coded as RDTXN and 'MADHU' is coded as ODFKW. How will 'VIJAY' be coded in the same language?
XLLDA
In this type of reasoning question, we need to find the hidden pattern or rule used to convert one set of letters (a word) into another set of letters (its code). The same rule must be applied consistently to all given examples and then to the word we need to code.
Let's look at the given examples:
We can analyze the shift in position for each letter in the alphabet. We can assign a numerical value to each letter (A=1, B=2, ..., Z=26).
| Original Word | Letter | Position | Coded Word | Coded Letter | Position | Shift |
|---|---|---|---|---|---|---|
| PARUL | P | 16 | RDTXN | R | 18 | $18 - 16 = +2$ |
| A | 1 | D | 4 | $4 - 1 = +3$ | ||
| R | 18 | T | 20 | $20 - 18 = +2$ | ||
| U | 21 | X | 24 | $24 - 21 = +3$ | ||
| L | 12 | N | 14 | $14 - 12 = +2$ |
| Original Word | Letter | Position | Coded Word | Coded Letter | Position | Shift |
|---|---|---|---|---|---|---|
| MADHU | M | 13 | ODFKW | O | 15 | $15 - 13 = +2$ |
| A | 1 | D | 4 | $4 - 1 = +3$ | ||
| D | 4 | F | 6 | $6 - 4 = +2$ | ||
| H | 8 | K | 11 | $11 - 8 = +3$ | ||
| U | 21 | W | 23 | $23 - 21 = +2$ |
From both examples, we can observe a consistent pattern: the letters are shifted by +2, +3, +2, +3, +2 positions respectively.
Now we apply the same pattern (+2, +3, +2, +3, +2) to the word 'VIJAY'. Let's find the position of each letter in 'VIJAY' and apply the shift.
Combining the coded letters, 'VIJAY' is coded as XLLDA.
Therefore, following the established coding language rule, 'VIJAY' is coded as 'XLLDA'.
| Letter | Position | Shift Pattern | New Position | Coded Letter |
|---|---|---|---|---|
| V | 22 | +2 | $22 + 2 = 24$ | X |
| I | 9 | +3 | $9 + 3 = 12$ | L |
| J | 10 | +2 | $10 + 2 = 12$ | L |
| A | 1 | +3 | $1 + 3 = 4$ | D |
| Y | 25 | +2 | $25 + 2 = 27 \rightarrow 1$ (wrap around) | A |
Coding-decoding is a common topic in logical reasoning tests. These questions assess your ability to decipher rules and patterns. The patterns can involve:
To solve these problems effectively, it is helpful to:
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?