In a certain code, the word MONKEY is written as XDJMNL. Using the same coding pattern, how will the word TIGER be written in that code?

Introduction / Context:
This coding and decoding question presents a code for one word and asks you to apply the same rule to another word. The given mapping is MONKEY → XDJMNL, and you must find the code for TIGER. The pattern involves reversing the word and then applying a simple alphabet shift, a very common style in reasoning exams.

Given Data / Assumptions:
Original word: MONKEY.
Code word: XDJMNL.
Target word: TIGER.
All letters are English uppercase, and the code is also in uppercase.
The rule from MONKEY to XDJMNL is the same rule that must be applied to TIGER.

Concept / Approach:
To crack the rule, you should compare the positions of letters in the alphabet. One helpful observation is that many such questions first reverse the word and then shift each letter forward or backward by a fixed amount. By testing this idea on MONKEY, you can uncover the transformation and then use it directly on TIGER.

Step-by-Step Solution:
Step 1: Write MONKEY. Now reverse the order of its letters to get YEKNOM. Step 2: Compare YEKNOM with the code XDJMNL. Now match the letters position by position. Step 3: Y becomes X. In the alphabet, X is one letter before Y, so Y has been shifted one step backward. Step 4: E becomes D. D is one letter before E, again a shift of one step backward. Step 5: K becomes J, N becomes M, O becomes N and M becomes L. In every case, the code letter is one position earlier in the alphabet than the reversed word letter. Step 6: Therefore, the rule is: reverse the original word and then shift each letter one step backward in the alphabet. Step 7: Now apply this rule to TIGER. First reverse TIGER to get REGIT. Step 8: Shift each letter one step backward: R becomes Q, E becomes D, G becomes F, I becomes H and T becomes S. Step 9: The resulting code is QDFHS.

Verification / Alternative check:
You can verify by repeating the full procedure for MONKEY: reverse MONKEY to YEKNOM and then move each letter one step backward, obtaining XDJMNL. This matches the given example exactly, confirming that the discovered rule is correct. Applying the same two stage rule to TIGER gives QDFHS, which is present as one of the options, confirming the answer.

Why Other Options Are Wrong:
SHFDQ, HFDSQ and RSAFD: Each of these sequences either does not correspond to a simple one step backward shift of the reversed word REGIT or fails to preserve the positional pattern. They do not follow the two stage transformation that correctly maps MONKEY to XDJMNL, so they cannot be correct codes for TIGER.

Common Pitfalls:
A frequent error is to try only direct letter shifts from MONKEY to XDJMNL without noticing the reversal step. This leads to confusing and inconsistent differences. Always consider whether the word might be reversed or split into parts before or after shifting letters. Another pitfall is to forget that a consistent rule must work for every letter, not just one or two positions.

Final Answer:
Using the same coding pattern as MONKEY → XDJMNL, the word TIGER is written as QDFHS.