The problem asks us to find the code for the word 'HIGH' based on the given codes for 'HIDE' and 'CAGE'. We need to determine the pattern or mapping used.
Let's analyze the given examples:
We compare the letters of the words to their corresponding numerical codes:
By comparing both examples, we observe that the letter 'E' consistently maps to 11. This suggests a direct letter-to-number mapping.
Based on the analysis of the examples, we establish the following mapping for the required letters:
| Letter | Alphabetical Position | Code |
|---|---|---|
| H | 8 | 19 |
| I | 9 | 23 |
| D | 4 | 7 |
| E | 5 | 11 |
| C | 3 | 5 |
| A | 1 | 2 |
| G | 7 | 17 |
Now, we apply this established mapping to find the code for 'HIGH':
Combining these codes, we get 19-23-17-19.
The code for HIGH is 19-23-17-19, which corresponds to Option 4.
In the given figure, EF and HJ are coded as 30 and 80, respectively. Which one among the given options is most appropriate for the entires marked (i) and (ii)?
Examine the given data. The value of X is ________ (in integer).
Hint: Onset clusters are not allowed in the language.
| 12 | buzbi |
| 20 | bizbu |
| 22 | bizbuzbi |
| 13 | busti |
| X | tizbuzbi |