The problem asks us to find the coded form of the word 'GRAPE' based on the given code for 'APPLE'. We need to identify the specific pattern or rule used to transform 'APPLE' into 'BQOKF' and then apply the same rule to 'GRAPE'.
Let's compare each letter of 'APPLE' with the corresponding letter in 'BQOKF':
To find the pattern, we look at the shift in the alphabetical position for each letter:
The pattern observed is a sequence of shifts based on the position of the letter in the word: +1, +1, -1, -1, +1.
Now, we apply this identified pattern (+1, +1, -1, -1, +1) to the word 'GRAPE':
| Letter in 'GRAPE' | Position | Shift Applied | Resulting Letter |
|---|---|---|---|
| G | 1 | +1 | H (G + 1 = H) |
| R | 2 | +1 | S (R + 1 = S) |
| A | 3 | -1 | Z (A - 1 = Z, wrapping around the alphabet) |
| P | 4 | -1 | O (P - 1 = O) |
| E | 5 | +1 | F (E + 1 = F) |
Following the pattern, 'GRAPE' is coded as 'HSZOF'.
The word 'GRAPE' is written as 'HSZOF' in the same code.
In a certain code language, ‘watch is disturb’ is written as ‘xr pa qn’ and ‘don’t watch him’ is written as ‘tu bg pa’. How is ‘watch’ written in the given language?
In a certain code language, ‘call on him’ is coded as ‘ol ni vc’ and ‘awaiting your call’ is coded as ‘ni dx sb’. How is ‘call’ coded in that language?
In a certain code language, 'talk to me' is coded as 'aq yt bl' and 'do not talk' is coded as 'yt me wc'. What is the code for 'talk' in that language?
In a certain code language, 'can we play' is coded as 'ae tc nx' and 'play in school' is coded as 'tc rm ef'. How is 'play' coded in that language?
In a certain code language, 'BOOK' is written as 'ZNNI' and 'SHOP' is written as 'QFNN'. How will 'NOTES' be written in that language?