Question

If in a certain code, PLANT is written as QMBOS, then how is BRICK written in the same code?

• A. CSJDL
• B. CSJDL
• C. CSKDL
• D. CSKEL

Hint:

• Analyze the letter-by-letter transformation from the example word (PLANT $\rightarrow$ QMBOS).
• Look for simple shifts (e.g., +1, -1), reversal, or patterns based on letter position or type (vowel/consonant).
• Pattern found: P(+1)Q, L(+1)M, A(+1)B, N(+1)O, T(-1)S.
• If this pattern is "first four letters +1, last letter -1", applies to BRICK: B(+1)C, R(+1)S, I(+1)J, C(+1)D, K(-1)J. Result: CSJDJ. (Not in options).
• Alternative pattern based on options: "All letters +1, unless the letter is 'T', in which case it is -1". PLANT: P,L,A,N get +1. T gets -1. $\rightarrow$ QMBOS. (Matches example). BRICK: B,R,I,C,K are not 'T'. So all get +1. $\rightarrow$ CSJDL. (Matches option a/b).
• This second rule seems to be the intended one.

Answer 1

The Correct Option is A

The coding pattern provided is:

\[ \text{PLANT} \rightarrow \text{QMBOS} \]

Analysis of the pattern:

P (16)	→ Q (17)	(+1)
L (12)	→ M (13)	(+1)
A (1)	→ B (2)	(+1)
N (14)	→ O (15)	(+1)
T (20)	→ S (19)	(-1)

Identified Pattern:

• The first four letters are incremented by 1.
• The letter 'T' at the end is decremented by 1.

Applying the pattern to BRICK:

B (2)	→ C (3)	(+1)
R (18)	→ S (19)	(+1)
I (9)	→ J (10)	(+1)
C (3)	→ D (4)	(+1)
K (11)	→ L (12)	(+1)

As the last letter is not 'T', it is also incremented by 1.

The coded form of BRICK is:

\[ \boxed{\text{CSJDL}} \]