If SCHEME is coded as TDIFNF, then what is the code for WONDER?
XPOEFS
The question asks us to find the coding pattern used to transform the word 'SCHEME' into 'TDIFNF' and then apply this pattern to the word 'WONDER'. Let's analyze the relationship between the letters of 'SCHEME' and 'TDIFNF'.
We compare each letter of the original word with the corresponding letter in the coded word:
| Original Letter | Coded Letter | Shift |
|---|---|---|
| S | T | $+1$ |
| C | D | $+1$ |
| H | I | $+1$ |
| E | F | $+1$ |
| M | N | $+1$ |
| E | F | $+1$ |
The analysis reveals that each letter in 'SCHEME' is shifted one position forward in the alphabet to get the corresponding letter in 'TDIFNF'. This is a consistent $+1$ shift (Caesar cipher with a shift of 1).
Now, we apply the same $+1$ shift pattern to the word 'WONDER':
Following this pattern, the coded word for 'WONDER' is 'XPOEFS'.
Comparing our result 'XPOEFS' with the given options:
The calculated code 'XPOEFS' matches option 4.
In a certain code language, COMPUTRONE is written as PMOCTUENOR. How is ADVANTAGES written in that code ?
In a certain code, GARNISH is written as RGAINHS. How will GENIOUS be written in that code?
In a certain code language, NOIDA is coded as STNIF. What will be the code for MEERUT?