Difficulty: Easy
Correct Answer: BDFH
Explanation:
Introduction / Context:
This is a classic letter-analogy problem from verbal reasoning. We compare how the first letter string transforms into the second string, then apply the identical rule to the third string to find the missing fourth string.
Given Data / Assumptions:
Concept / Approach:
The best strategy is to compute the letter-wise shift between corresponding letters in the given pair and check if it is consistent. If the shift is constant, we apply it to the next string letter by letter, using wrap-around modular arithmetic (after Z comes A).
Step-by-Step Solution:
Verification / Alternative check:
Add 8 to each next letter and wrap beyond Z back to A. The computed string BDFH matches the pattern and is present among the options.
Why Other Options Are Wrong:
Common Pitfalls:
Mistaking the sequence as every-second-letter pattern instead of a fixed shift; forgetting to wrap around after Z when adding.
Final Answer:
BDFH
Discussion & Comments