Question

Fill in the blank from the choice given below :-
APXH : BOYG, JSRD :

• A. \(KRSC \)
• B. \(KSRC \)
• C. \(KCRS \)
• D. \(KSCR \)

Hint:

When resolving alphanumeric sequences, quickly jotting down positional shifts like \((+1, -1, +1, -1)\) protects against basic logical slipups. Always verify each letter step-by-step instead of guessing based purely on the starting character!

Answer 1

The Correct Option is B

Concept: Alphabetical analogy problems operate based on systematic shifting patterns, fixed letter distances, or positional value properties in the standard English alphabet sequence (where A=1, B=2, ..., Z=26). To solve, we decode the explicit rule governing the transformation of the first pair and apply it identically to the third term.

Step 1: Analyze the positional tracking of letters between APXH and BOYG.
Let us look at each letter position in the first group and see how it transitions to the corresponding letter in the second group:

• First letter transition (\(A \rightarrow B\)):
The letter B follows immediately after A. \[ \text{Position change: } A + 1 = B \]

• Second letter transition (\(P \rightarrow O\)):
The letter O precedes P in standard order. \[ \text{Position change: } P - 1 = O \]

• Third letter transition (\(X \rightarrow Y\)):
The letter Y comes immediately after X. \[ \text{Position change: } X + 1 = Y \]

• Fourth letter transition (\(H \rightarrow G\)):
The letter G comes just before H. \[ \text{Position change: } H - 1 = G \]
Thus, the alternating shifting rule deciphered here is:

\(+1, -1, +1, -1\).

Step 2: Apply this identical alternating rule to the word JSRD.
Let us apply the verified pattern systematically to each component letter of the term JSRD:

• First Letter (\(J\)): Apply a shift of \(+1\) \[ J + 1 = K \]

• Second Letter (\(S\)): Apply a shift of \(-1\) \[ S - 1 = R \]

• Third Letter (\(R\)): Apply a shift of \(+1\) \[ R + 1 = S \]

• Fourth Letter (\(D\)): Apply a shift of \(-1\) \[ D - 1 = C \]
Combining these individual transformed characters in chronological order yields the code:

KRSC. Let us double check against the options carefully. Oh, option (A) reads KRSC. Let us re-verify option letters from the image text: the alphabet positions are precisely \(J(+1)=K\), \(S(-1)=R\), \(R(+1)=S\), \(D(-1)=C\). This maps directly to KRSC, matching Option (A).