Question

In a certain code language, SHORE is written as PELOB, then match the following original letters in List-I that are coded in List-II.

Codes:

• A. a - iv, b - i, c - ii, d - iii
• B. a - iv, b - i, c - iii, d - ii
• C. a - iii, b - i, c - ii, d - iv
• D. a - ii, b - iii, c - i, d - iv

Hint:

When a coding-decoding problem shows a constant shift between letters, convert the letters into their alphabetical positions and check the difference. Here, every coded letter is obtained by moving three positions backward in the alphabet.

Answer 1

The Correct Option is B

Concept: Coding-decoding questions are solved by identifying the relationship between the original word and its coded form. The given example shows that every letter is shifted by a fixed number of positions in the English alphabet.

Step 1: Determine the coding rule Given: \[ \text{SHORE} \rightarrow \text{PELOB} \] Let us compare corresponding letters: \[ \begin{array}{c|ccccc} \text{Original} & S & H & O & R & E \hline \text{Code} & P & E & L & O & B \end{array} \] Converting to alphabetical positions: \[ S(19)\rightarrow P(16) \] \[ H(8)\rightarrow E(5) \] \[ O(15)\rightarrow L(12) \] \[ R(18)\rightarrow O(15) \] \[ E(5)\rightarrow B(B) \] Each coded letter is obtained by moving 3 positions backward in the alphabet. Thus, \[ \text{Code Letter} = \text{Original Letter} - 3 \]

Step 2: Apply the rule to List-I
• (a) B \[ B \rightarrow Y \] (three positions backward with wrap-around) Hence, \[ a \rightarrow iv \]
• (b) Z \[ Z \rightarrow W \] Hence, \[ b \rightarrow i \]
• (c) Q \[ Q \rightarrow N \] Hence, \[ c \rightarrow iii \]
• (d) J \[ J \rightarrow G \] Hence, \[ d \rightarrow ii \]

Step 3: Final Matching \[ a \rightarrow iv,\qquad b \rightarrow i,\qquad c \rightarrow iii,\qquad d \rightarrow ii \] This corresponds to Option (B).