In a certain code language, 'SPAIN' is coded as '14-9-1-16-19'. How will 'MADRAS' be coded in that language?
This question involves a type of coding-decoding problem where words are coded using numbers. We need to find the pattern used to code 'SPAIN' as '14-9-1-16-19' and then apply the same pattern to find the code for 'MADRAS'.
Let's look at the letters in 'SPAIN' and their corresponding numbers in the code:
We can also look at the standard alphabetical positions of these letters:
Let's compare the alphabetical positions with the given code numbers:
| Letter | Alphabetical Position | Given Code |
|---|---|---|
| S | 19 | 14 |
| P | 16 | 9 |
| A | 1 | 1 |
| I | 9 | 16 |
| N | 14 | 19 |
Observing this table, it's not a simple shift in position or a constant addition/subtraction. Let's consider the letters of 'SPAIN' in reverse order: N, I, A, P, S.
Now let's compare the alphabetical positions of the letters in reverse order with the given code:
| Letter (Reverse Order) | Alphabetical Position | Given Code |
|---|---|---|
| N | 14 | 14 |
| I | 9 | 9 |
| A | 1 | 1 |
| P | 16 | 16 |
| S | 19 | 19 |
We can see a clear pattern here. The code for 'SPAIN' is formed by taking the letters of the word in reverse order and writing down their standard alphabetical positions.
Putting these numbers together in the order of the reversed word (N, I, A, P, S) gives us 14-9-1-16-19, which matches the given code for 'SPAIN'.
Now we apply the same pattern to the word 'MADRAS'.
Step 1: Write the letters of 'MADRAS' in reverse order.
The letters in reverse order are S, A, R, D, A, M.
Step 2: Find the alphabetical position for each of these letters.
Step 3: Combine the alphabetical positions in the order of the reversed letters.
The numbers are 19, 1, 18, 4, 1, 13.
So, the code for 'MADRAS' is 19-1-18-4-1-13.
Comparing this code with the given options, we find that 19-1-18-4-1-13 matches one of the options.
| Word | Letters in Reverse Order | Alphabetical Positions | Code |
|---|---|---|---|
| SPAIN | N, I, A, P, S | 14, 9, 1, 16, 19 | 14-9-1-16-19 |
| MADRAS | S, A, R, D, A, M | 19, 1, 18, 4, 1, 13 | 19-1-18-4-1-13 |
Letter coding is a common type of question in reasoning sections of competitive exams. Understanding different patterns is key to solving these problems quickly. Some common patterns include:
Practicing different examples helps in quickly identifying the pattern used in a specific coding-decoding problem.
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?