In a certain cipher language 'BIKE' is coded as 'YFHB' and 'CAR' is coded as 'ZXO' then 'SCOOTER' can be coded as
PZLLQBO
This question involves decoding a cipher language where words are transformed into coded forms. We are given two examples:
We need to find the code for 'SCOOTER' using the same cipher rule.
Let's look at the relationship between the letters in the original words and their coded forms. We can use the position of each letter in the English alphabet (A=1, B=2, ..., Z=26) to find the pattern.
Let's compare the letter positions:
| Original Letter | Position | Coded Letter | Position | Difference/Relation |
|---|---|---|---|---|
| B | 2 | Y | 25 | 25 = 2 - 3 (with wrap-around from Z) or 2+23=25? |
| I | 9 | F | 6 | 6 = 9 - 3 |
| K | 11 | H | 8 | 8 = 11 - 3 |
| E | 5 | B | 2 | 2 = 5 - 3 |
For the letters I, K, and E, the coded letter's position is 3 less than the original letter's position.
Let's compare the letter positions:
| Original Letter | Position | Coded Letter | Position | Difference/Relation |
|---|---|---|---|---|
| C | 3 | Z | 26 | 26 = 3 - 3 (with wrap-around from A) |
| A | 1 | X | 24 | 24 = 1 - 3 (with wrap-around from Z) |
| R | 18 | O | 15 | 15 = 18 - 3 |
For A and R, the coded letter's position is 3 less than the original letter's position. For C, C(3) becomes Z(26), which is also a shift of -3 when considering wrapping around the alphabet (C → B → A → Z).
From the analysis of both examples, it appears that each letter in the original word is replaced by the letter that is 3 positions before it in the English alphabet. When shifting backward from letters near the beginning of the alphabet (A, B, C), the counting wraps around from Z.
Let's represent this mathematically using modular arithmetic. The position of a letter \(L\) is \(Pos(L)\). The coded position \(Pos(L')\) is given by:
\(Pos(L') = (Pos(L) - 3 - 1 \pmod{26}) + 1\)
Alternatively, and perhaps simpler for backward shifts with wrap-around:
\(Pos(L') = (Pos(L) - 3)\)
If \(Pos(L') \le 0\), add 26. For example:
This rule consistently explains both 'BIKE' → 'YFHB' and 'CAR' → 'ZXO'.
Now, let's apply this "shift -3" rule to each letter of the word 'SCOOTER'.
| Original Letter | Position | Shift -3 | Resulting Position | Coded Letter |
|---|---|---|---|---|
| S | 19 | 19 - 3 | 16 | P (16) |
| C | 3 | 3 - 3 | 0 \(\rightarrow\) 0+26=26 | Z (26) |
| O | 15 | 15 - 3 | 12 | L (12) |
| O | 15 | 15 - 3 | 12 | L (12) |
| T | 20 | 20 - 3 | 17 | Q (17) |
| E | 5 | 5 - 3 | 2 | B (2) |
| R | 18 | 18 - 3 | 15 | O (15) |
Combining the coded letters, 'SCOOTER' is coded as 'PZLLQBO'.
Let's check the given options:
The coded word 'PZLLQBO' matches Option 3.
Each vowel In the word “CAPSULE” Is changed to the previous letter In the English alphabetical series and each consonant is changed to the following letter in the English alphabetical series. In the newly formed word, how many alphabets are there in the English alphabetical series between the alphabet which is 3rd from the left and 3rd from the right?
In a certain code language, if ‘PDFJARS’ is written as ‘OCELZQR’ and ‘MHCXBTU’ is written as ‘LGBZAST’, how will ‘ZVDGENQ’ be written in the same code language?
Which of the following letter-clusters will replace the question mark (?) in the given series to make it logically complete?
ADZ, GJF, MPL, SVR, ?
In a certain code language, 'BENT' is coded as '3198' and 'DEBT' is coded as '8316'. What is the code for 'N' in the given code language?
In a certain code language, GAME is written as TUZANOVW, and CAR is written as XYZAIJ. How will POST be written in that language ?