Question 1

Analogy (cause → effect): Relate the second pair by the same outcome logic.  Race : Fatigue :: Fast : ?  Choose the option that shows the most likely effect.

Accepted Answer

Concept A race typically results in fatigue; a fast (abstaining from food) typically results in hunger. Elimination Feast is the opposite; speed/slow/diet do not express the direct physiological effect. Final Answer Hunger

Question 2

Analogy (antonyms): Choose the opposite pair matching “Peace : Chaos”.  Peace : Chaos :: Creation : ?  Select the antonym that best completes the analogy.

Accepted Answer

Concept “Peace : Chaos” is an antonymic relation. The natural opposite of Creation is Destruction. Note Annihilation is a hypernym of destruction; “Destruction” is the standard textbook antonym used in such analogies. Final Answer Destruction

Question 3

Analogy (habitat): Match the animal with its typical habitat in the same way as “Tiger : Forest”.  Tiger : Forest :: Otter : ?  Choose the best habitat.

Accepted Answer

Reasoning Tigers are associated with forests. Otters are semi-aquatic mammals commonly associated with rivers and freshwater systems. Final Answer River

Question 4

Analogy (parts of a device): Identify the battery counterpart of “Poles : Magnet”.  Poles : Magnet :: ? : Battery  Choose the option that names the corresponding parts.

Accepted Answer

Concept A magnet has poles (north/south). A battery has terminals (positive/negative) as its two external connection points. Elimination Plates are internal components; cells are units; volt is a unit; charge is a quantity, not a part. Final Answer Terminals

Question 5

Analogy (attire/office): Map the distinctive garment to the role as in “Cassock : Priest”.  Cassock : Priest :: ? : Graduate  Choose the garment that completes the analogy.

Accepted Answer

Reasoning A cassock is the distinctive garment for a priest. A gown (academic robe) is the distinctive garment for a graduate at convocation. Note A mortarboard cap/hood are accessories, but the primary garment is the academic gown. Final Answer Gown

Question 6

Ice : Coldness :: Earth :?

Accepted Answer

As effect of Ice is coldness similarly the effect of Earth is gravitation.

Question 7

Parts : Strap :: Wolf :?

Accepted Answer

Question 8

Physician : Treatment :: Judge :?

Accepted Answer

As Physician does the treatment similarly Judge delivers the judgement.

Question 9

Alphabet Analogy — Consistent Shift Pattern BEGK : ADFJ :: PSVY : ?

Accepted Answer

Introduction / Context: Letter analogies often rely on fixed positional shifts in the alphabet. Identifying the rule in the first pair and applying it to the second yields the missing term. Given Data / Assumptions: First pair: BEGK → ADFJ. Second pair: PSVY → ? Alphabet positions: A=1, B=2, …, Z=26. Concept / Approach: Compare each corresponding letter in the first pair to detect a uniform transformation. If consistent, apply the same shift to the second source string to compute the answer. Step-by-Step Solution: B(2) → A(1): shift −1.E(5) → D(4): shift −1.G(7) → F(6): shift −1.K(11) → J(10): shift −1.Hence the rule is “each letter −1.”Apply to PSVY: P→O, S→R, V→U, Y→X. Result = ORUX. Verification / Alternative check: Reversing the process (adding 1 to ADFJ) gives BEGK, confirming the detected rule and its consistency. Why Other Options Are Wrong: ROUX: First letter should be O, not R. LQUT / LOQT: These reflect different shifts and do not match the uniform −1 rule. None of the above: Incorrect because a valid option exists. Common Pitfalls: Overcomplicating the pattern or mixing different shifts. Always test simple uniform shifts first. Final Answer: ORUX

Question 10

Alphabet Analogy — Alternating Bidirectional Shifts AZBY : CXDW :: EVFU : ?

Accepted Answer

Introduction / Context: This alphabet analogy uses alternating shifts: forward then backward repeatedly. Detecting the alternation in the first pair allows us to apply it to the second string precisely. Given Data / Assumptions: First mapping: AZBY → CXDW. Second mapping target: EVFU → ? Alphabet indexing: A=1 … Z=26. Concept / Approach: Compare each position in the first pair to see if the direction and magnitude of shifts alternate. Apply the same +/− pattern consistently to the second sequence. Step-by-Step Solution: A(1) → C(3): +2.Z(26) → X(24): −2.B(2) → D(4): +2.Y(25) → W(23): −2.So the rule is “+2, −2, +2, −2.”Apply to EVFU: E→G (+2), V→T (−2), F→H (+2), U→S (−2). Result = GTHS. Verification / Alternative check: Check reverse: subtracting and adding back restores EVFU, confirming the pattern’s correctness. Why Other Options Are Wrong: GHTS / GSTH / TGSH scramble the order or use incorrect intermediate letters, breaking the strict +2/−2 alternation. None of the above: Not applicable because GTHS fits perfectly. Common Pitfalls: Forgetting to alternate directions or miscounting positions when wrapping near Z. Here, no wrap-around occurs, simplifying the calculation. Final Answer: GTHS

Question 11

Alphabet Analogy — Fixed Forward Shift by 8 ACEG : IKMO :: QSUW : ?

Accepted Answer

Introduction / Context: Another standard letter analogy uses a constant forward shift. Identify the magnitude in the exemplar pair and apply the same to the query pair, wrapping around the alphabet as needed. Given Data / Assumptions: Mapping: ACEG → IKMO. Target: QSUW → ? Alphabet positions: A=1 … Z=26. Concept / Approach: Compute the difference for corresponding letters in the first pair, confirm the difference is consistent, then add that difference to each letter of the second string. When sums exceed 26, wrap around by subtracting 26. Step-by-Step Solution: A(1) → I(9): +8.C(3) → K(11): +8.E(5) → M(13): +8.G(7) → O(15): +8.Rule: add 8 to each letter.Apply to QSUW: Q(17)+8=25 → Y; S(19)+8=27 → 27−26=1 → A; U(21)+8=29 → 29−26=3 → C; W(23)+8=31 → 31−26=5 → E.Therefore, QSUW → YACE. Verification / Alternative check: Apply −8 to YACE: Y→Q, A→S (wrapping backward), C→U, E→W. We recover QSUW, confirming the mapping. Why Other Options Are Wrong: YZCE / YBCE / YACD alter one or more letters, not matching the exact +8 rule with wrap-around. None of the above: Incorrect because YACE is present and correct. Common Pitfalls: Forgetting wrap-around beyond Z. Always convert positions exceeding 26 by subtracting 26 (or use modular arithmetic). Final Answer: YACE

Question 12

Letter analogy with uniform forward shift: BCFG : HILM :: NORQ : ?

Accepted Answer

Introduction / Context: This verbal-reasoning analogy checks your ability to detect a consistent alphabetic shift pattern and apply it to a new set of letters. Such questions are common in competitive aptitude tests to assess pattern recognition and rule transfer. Given Data / Assumptions: Source pair: BCFG maps to HILM. Target stem: NORQ maps to ? Assume a fixed forward shift unless evidence suggests otherwise. Concept / Approach: Compare each corresponding letter to determine the shift. If the shift is uniform across all letters in the first mapping, apply the same shift to each letter of the second group. Use A=1, B=2, …, Z=26 indexing for clarity. Step-by-Step Solution: From B to H is +6; C→I is +6; F→L is +6; G→M is +6.Therefore, the rule is a uniform +6 shift.Apply +6 to N O R Q: N→T, O→U, R→X, Q→W.Thus, NORQ becomes TUXW. Verification / Alternative check: Reverse-check by subtracting 6 from TUXW: T→N, U→O, X→R, W→Q. This returns the original, confirming the mapping is correct and consistent. Why Other Options Are Wrong: TXWU/TXUW/TVWX: These scramble some letters but do not maintain the exact +6 shift for every position. Common Pitfalls: Mixing letter order after shifting, or applying different shifts to different letters. Keep the rule uniform across all positions once identified. Final Answer: TUXW

Question 13

Alphabet analogy using a constant Caesar shift: ZRYQ : KCJB :: PWOV : ?

Accepted Answer

Introduction / Context: This analogy involves a constant Caesar cipher (same shift for each letter). Identifying the exact shift on the first pair and transferring it to the second pair is the key skill, frequently tested in logical-reasoning and coding-decoding problems. Given Data / Assumptions: ZRYQ maps to KCJB. We must map PWOV to an unknown using the same rule. Use modular arithmetic on letters with A=1 to Z=26; wrap around after Z. Concept / Approach: Compute the shift letter-by-letter for the first mapping. If the shift is uniform, apply it to the second group. Forward and backward descriptions are equivalent; consistency is what matters. Step-by-Step Solution: Z(26)→K(11): +11 mod 26 (or −15). R(18)→C(3): +11. Y(25)→J(10): +11. Q(17)→B(2): +11.Hence the consistent rule is “add 11.”Apply +11 to PWOV: P(16)→A(1), W(23)→H(8), O(15)→Z(26), V(22)→G(7).So PWOV becomes AHZG. Verification / Alternative check: Back-shift by −11 on AHZG to confirm: A→P, H→W, Z→O, G→V. The original is recovered, verifying correctness. Why Other Options Are Wrong: BIAH/QXPA/ZGWF: Each breaks the uniform +11 rule on at least one letter, resulting in inconsistencies. Common Pitfalls: Using different shifts per position, or forgetting wrap-around at alphabet boundaries (e.g., 26 + 1 = 1). Always apply the same shift consistently. Final Answer: AHZG

Question 14

Identify the transformation: KeaC : CaeK :: XgmF : ?

Accepted Answer

Introduction / Context: This is a pure rearrangement (reversal) analogy. Many coding-decoding questions use simple reversals to test attention to letter order rather than arithmetic shifts. Given Data / Assumptions: KeaC maps to CaeK. We must map XgmF to an unknown using the same transformation. No case changes or shifts are implied—only reordering. Concept / Approach: Check whether the second term is the reverse of the first. Since KeaC reversed letter-by-letter is CaeK, the rule is “reverse the string.” Apply the same to the new term. Step-by-Step Solution: Reverse KeaC → CaeK confirms rule.Reverse XgmF → FmgX.Therefore, the answer is FmgX. Verification / Alternative check: Reverse FmgX to retrieve XgmF; this confirms a perfect involution (operation equals its own inverse). Why Other Options Are Wrong: GmcF/EgmX/EmgF: These introduce letter substitutions or partial reorders rather than a full reversal. Common Pitfalls: Overthinking a simple reversal and searching for shifts; always test the simplest pattern first—often it is a full reverse. Final Answer: FmgX

Question 15

Alternating Caesar shift (−3, +3): Corden : zrogbq :: ? : pxivro

Accepted Answer

Introduction / Context: This analogy uses an alternating Caesar shift, switching direction on each successive letter. Recognizing alternating operations is essential in decoding many exam-style letter coding problems. Given Data / Assumptions: Corden → zrogbq. We must find a word that transforms to pxivro under the same rule. Pattern observed in the first pair appears to be −3, +3, −3, +3, … per letter. Concept / Approach: Verify the alternating pattern on the first mapping, then invert the process to recover the preimage for pxivro. Use A=1 … Z=26 and modular wrap-around. Step-by-Step Solution: C→z (−3), o→r (+3), r→o (−3), d→g (+3), e→b (−3), n→q (+3). Pattern confirmed.To get pxivro, invert letter-by-letter: positions 1,3,5 were “−3,” so original = encoded +3; positions 2,4,6 were “+3,” so original = encoded −3.1: p→s, 2: x→u, 3: i→l, 4: v→s, 5: r→u, 6: o→l.Thus the original word is sulsul. Verification / Alternative check: Apply the forward alternating rule to “sulsul”: s→p (−3), u→x (+3), l→i (−3), s→v (+3), u→r (−3), l→o (+3). This reproduces pxivro exactly. Why Other Options Are Wrong: mulmul/munmun/srspql: None produce pxivro when the exact alternating −3/+3 rule is applied throughout. Common Pitfalls: Applying a constant shift to all letters, or reversing the alternation mid-word. Keep careful track of positions and signs. Final Answer: sulsul

Question 16

Find the preimage under a constant +4 shift: LKJ : pon :: ? : hgf

Accepted Answer

Introduction / Context: This coding-decoding item uses a constant forward shift across letters. We are given the output and must infer the input by reversing the shift. Such inverse reasoning is routine in alphabet mapping questions. Given Data / Assumptions: LKJ maps to pon with a +4 shift (L→p, K→o, J→n). We need a word that maps to hgf via the same +4 rule. Case is not semantically important; letter identities are. Concept / Approach: If output = input shifted by +4, then input = output shifted by −4. Compute each letter accordingly using alphabet positions with wrap-around as needed. Step-by-Step Solution: Determine the inverse: h (8) − 4 = d (4), g (7) − 4 = c (3), f (6) − 4 = b (2).Therefore, the input word is d c b → “DCB” in uppercase.Quick check: d+4=h, c+4=g, b+4=f, confirming correctness. Verification / Alternative check: Reapply the forward rule on DCB to see if you recover hgf. The mapping is exact and uniform, so the verification succeeds immediately. Why Other Options Are Wrong: dcle/DBC/dcd: Each contains at least one letter that fails the strict −4 back-shift from h, g, f. Common Pitfalls: Miscounting by one step or swapping direction (+4 vs −4). Always compute carefully and maintain consistency across all positions. Final Answer: DCB

Question 17

Apply alternating +3, +2 shift: Computer : fqprxvht :: Language : ?

Accepted Answer

Introduction / Context: This problem features an alternating Caesar shift pattern: +3 on the first letter, +2 on the next, and so on. Detecting alternating shifts is a frequent theme in coding-decoding analogies. Given Data / Assumptions: “Computer” encodes to “fqprxvht”. We must encode “Language” using the same alternating shift. Alphabet index A=1 … Z=26 with wrap-around. Concept / Approach: Verify the alternation on the example, then apply +3 to positions 1,3,5,… and +2 to positions 2,4,6,… of “Language”. Keep letter order intact and wrap after Z if necessary. Step-by-Step Solution: Check “Computer”: c→f (+3), o→q (+2), m→p (+3), p→r (+2), u→x (+3), t→v (+2), e→h (+3), r→t (+2). Pattern confirmed.Apply to “Language”: L→O (+3), a→c (+2), n→q (+3), g→i (+2), u→x (+3), a→c (+2), g→j (+3), e→g (+2).Result: ocqixcjg. Verification / Alternative check: Decoding by alternating −3, −2 brings “ocqixcjg” back to “Language,” confirming the rule and application are correct. Why Other Options Are Wrong: oxpixdig/ocqicyig/ocqixcig: Each deviates at one or more positions from the strict +3, +2 alternation applied to the true letter values. Common Pitfalls: Losing track of the alternation after a few letters or misapplying +2 and +3 to the wrong positions. Mark odd and even positions clearly before computing. Final Answer: ocqixcjg

Question 18

Find the preimage under a constant +10 shift: AEFJ : KOPT :: ? : QUVZ

Accepted Answer

Introduction / Context: Here the coding rule is a constant Caesar shift of +10. You must reverse the shift to find which input would encode to the given output, practicing inverse reasoning on uniform ciphers. Given Data / Assumptions: AEFJ → KOPT shows +10 for each letter. We need ? → QUVZ using the same +10 rule. Use modular wrap-around with A=1 … Z=26. Concept / Approach: If encoded = original + 10, then original = encoded − 10. Subtract 10 from each of Q, U, V, Z to obtain the preimage. Step-by-Step Solution: Q(17) − 10 = G(7).U(21) − 10 = K(11).V(22) − 10 = L(12).Z(26) − 10 = P(16).Thus the input word is GKLP. Verification / Alternative check: Apply +10 to GKLP → QUVZ, recovering the target perfectly. This confirms the uniform shift assumption and implementation. Why Other Options Are Wrong: GLKP/HKLP/HKQL: Each has at least one letter that fails the exact −10 back-shift from Q, U, V, Z. Common Pitfalls: Confusing addition and subtraction or miscounting wrap-around from A or Z. Carefully compute each letter independently. Final Answer: GKLP

Question 19

Simple Caesar +1 mapping: PASS : QBTT :: FAIL : ?

Accepted Answer

Introduction / Context: This is a straightforward Caesar cipher with a uniform shift of +1 applied to each letter. It is a foundational pattern used to test quick recognition of simple encoding rules in analogy questions. Given Data / Assumptions: PASS → QBTT implies P→Q, A→B, S→T, S→T (each +1). We must encode FAIL using the same rule. Concept / Approach: Apply +1 to each character of FAIL independently and assemble the result. Remember to maintain letter order and use alphabetical wrap-around only if reaching Z (not needed here). Step-by-Step Solution: F→G (+1)A→B (+1)I→J (+1)L→M (+1)Therefore, FAIL → GBJM. Verification / Alternative check: Decoding by −1 returns FAIL from GBJM, confirming the mapping and computation are exact. Why Other Options Are Wrong: GJBM/MBJG/MJBG: These options misplace letters or alter the order, violating the uniform +1 rule and the original letter sequence. Common Pitfalls: Reordering letters or accidentally applying varying shifts. Keep the process strictly position-wise and constant. Final Answer: GBJM

Question 20

Atbash (mirror-alphabet) cipher: BLOCKED : YOLXPVW :: ? : OZFMXS

Accepted Answer

Introduction / Context: This analogy employs the classic Atbash (mirror-alphabet) cipher, where each letter maps to its mirror from the opposite end of the alphabet (A↔Z, B↔Y, C↔X, …). Recognizing Atbash is useful in many coding-decoding contexts. Given Data / Assumptions: BLOCKED encodes to YOLXPVW under Atbash. We must find a word that encodes to OZFMXS under the same mapping. Atbash is its own inverse; applying it twice returns the original text. Concept / Approach: To decode OZFMXS, apply Atbash to each letter: original = mirror of encoded. Then match the resulting plaintext to one of the options. Step-by-Step Solution: O↔L, Z↔A, F↔U, M↔N, X↔C, S↔H.Thus, OZFMXS decodes to LAUNCH.Check: Apply Atbash to LAUNCH → OZFMXS, confirming the mapping. Verification / Alternative check: Because Atbash is an involution, encoding and decoding are identical operations. One forward pass suffices to verify both directions. Why Other Options Are Wrong: DEBATE/RESULT/LABOR: Their Atbash encodings do not equal OZFMXS; each produces a different 6-letter string. Common Pitfalls: Confusing Atbash with Caesar shifts or forgetting it maps A↔Z, B↔Y, etc. Always write the mirror pairs or remember the formula: position′ = 27 − position. Final Answer: LAUNCH

Analogy Questions