3.1 Coding-Decoding and Symbolic Substitution

3.1 Coding-Decoding and Symbolic Substitution

Coding-decoding and symbolic substitution are established verbal-reasoning practice types for the preliminary screen. They measure your mental agility, working memory, and capacity to recognize systematic transformations under acute time pressure.

Rather than testing linguistic vocabulary, coding questions evaluate your ability to identify rules of substitution, displacement, inversion, and operational redefinition. During practice, master positional anchors and pattern archetypes so that you do not depend on lengthy written lookup tables.

---

Mental Alphabet Anchors: The EJOTY and CFILORUXZ Rules

Rather than repeatedly writing the full alphabet during timed practice, memorize benchmark anchor letters whose numeric positions correspond to multiples of 5 and multiples of 3.

The EJOTY Framework (Multiples of 5)

Using EJOTY, you can locate any letter in the alphabet in under two seconds by calculating its offset from the nearest multiple of 5:

• To find G: Since $E = 5$, count two forward: $F = 6, G = 7$.
• To find S: Since $T = 20$, count one backward: $S = 19$.
• To find W: Since $Y = 25$, count two backward: $W = 23$ (or three forward from $T = 20$).

The CFILORUXZ Framework (Multiples of 3)

For even faster triangulation, use the three-letter skip mnemonic CFI-LOR-UX:

$$\begin{array}{cccccccc} \mathbf{C} & \mathbf{F} & \mathbf{I} & \mathbf{L} & \mathbf{O} & \mathbf{R} & \mathbf{U} & \mathbf{X} \\ 3 & 6 & 9 & 12 & 15 & 18 & 21 & 24 \end{array}$$

If a question involves the letter Q, knowing $R = 18$ immediately tells you that $Q = 17$. If a question involves M, knowing $L = 12$ immediately gives $M = 13$.

---

Letter-to-Letter Coding Mechanisms

Letter-to-letter ciphers map each character of an original word to a new character in a code word. These transformations fall into three regular patterns.

1. Constant Displacement

In constant displacement, every letter in the original word shifts forward ($+k$) or backward ($-k$) by a fixed integer across the alphabet.

• Forward Constant Shift ($+k$): If DELHI is coded as EFMIJ with a forward shift of $+1$:

$$\begin{aligned} D(4) + 1 &= E(5) \\ E(5) + 1 &= F(6) \\ L(12) + 1 &= M(13) \\ H(8) + 1 &= I(9) \\ I(9) + 1 &= J(10) \end{aligned}$$

Similarly, if BOMBAY is coded as DQODCA with a forward shift of $+2$:

$$\begin{aligned} B(2) + 2 &= D(4) \\ O(15) + 2 &= Q(17) \\ M(13) + 2 &= O(15) \\ B(2) + 2 &= D(4) \\ A(1) + 2 &= C(3) \\ Y(25) + 2 &= A(1) \quad (\text{wrapping around from } Z) \end{aligned}$$

• Backward Constant Shift ($-k$): If TIGER is coded as QDFBO:

$$\begin{aligned} T(20) - 3 &= Q(17) \\ I(9) - 3 &= F(6) \\ G(7) - 3 &= D(4) \\ E(5) - 3 &= B(2) \\ R(18) - 3 &= O(15) \end{aligned}$$

• Alternating Displacement: A sequence may alternate between positive and negative shifts, such as $+1, -1, +1, -1$ or $+2, -2, +2, -2$.

2. Progressive Displacement

In progressive displacement, the shift value increments or decrements with each successive letter in the string.

• Increasing Progression ($+1, +2, +3, +4, +5$): Suppose MARCH is transformed into NCUGM:

$$\begin{aligned} M(13) &\xrightarrow{+1} N(14) \\ A(1) &\xrightarrow{+2} C(3) \\ R(18) &\xrightarrow{+3} U(21) \\ C(3) &\xrightarrow{+4} G(7) \\ H(8) &\xrightarrow{+5} M(13) \end{aligned}$$

• Decreasing Progression ($+5, +4, +3, +2, +1$): Used less frequently, but built on the same orderly logic.

3. Opposite Letter / Mirror Alphabet Encoding (The 27 Rule)

In mirror encoding, letters are paired according to their equidistant positions from the beginning and end of the alphabet ($A \leftrightarrow Z, B \leftrightarrow Y, C \leftrightarrow X$).

To identify mirror pairs instantly during CBT exams without manual counting, memorize these classic word anchors:

Worked Example: If LEAP is coded as OVZK, what is the code for MINT?

1. Verify the rule: $L(12) \leftrightarrow O(15)$ ($12+15=27$), $E(5) \leftrightarrow V(22)$ ($5+22=27$), $A(1) \leftrightarrow Z(26)$, $P(16) \leftrightarrow K(11)$. This confirms mirror pairing.
2. Apply the 27 rule to MINT:
   • $M(13) \implies 27 - 13 = 14 \implies N$
   • $I(9) \implies 27 - 9 = 18 \implies R$
   • $N(14) \implies 27 - 14 = 13 \implies M$
   • $T(20) \implies 27 - 20 = 7 \implies G$
3. The resulting code is NRMG.

---

Letter-to-Number Coding Mechanisms

In letter-to-number problems, letters are converted into numeric values through algebraic operations on their positional values.

1. Positional Summation and Multipliers

• Direct Sum: The code represents the direct arithmetic sum of the letter positions.

  • Example: BAD $= 2 + 1 + 4 = 7$.
  • Example: CAB $= 3 + 1 + 2 = 6$.

• Weighted Sum (Multiplied by Number of Letters):

  • If GO $= 32$ and SHE $= 49$, find the code for SOME.
  • Analysis: For GO, $G=7, O=15$, sum $= 22$. Notice that $22$ is not $32$. Check reverse positions: opposite of $G$ is $T(20)$, opposite of $O$ is $L(12)$. The sum of reverse positions is $20 + 12 = 32$!
  • Check SHE with reverse positions: opposite of $S$ is $H(8)$, opposite of $H$ is $S(19)$, opposite of $E$ is $V(22)$. Sum: $8 + 19 + 22 = 49$. The rule is confirmed as the sum of reverse positional values.
  • For SOME: reverse values are $S \leftrightarrow 8$, $O \leftrightarrow 12$, $M \leftrightarrow 14$, $E \leftrightarrow 22$. Sum: $8 + 12 + 14 + 22 = 56$.

2. Positional Sequence Substitution

Each letter is substituted directly by its two-digit or single-digit index without summation.

• Example: LEAD is written as 12514 ($L=12, E=5, A=1, D=4$).

---

Comparative Message and Sentence Coding

In sentence coding, several arbitrary statements written in a fictitious code are presented alongside their English meanings. Your task is to identify the precise code word for an individual English word.

The Elimination Matrix Method

Never attempt to translate word-by-word in sequential order. Fictitious languages rarely follow English grammatical syntax. Instead, compare statements pair-wise to isolate words that appear in both statements:

1. Statement 1: pit dar na means you are good
2. Statement 2: dar tok pa means good boy run
3. Statement 3: na so means you sit

Step-by-Step Isolation:

• Compare Statement 1 and Statement 2:
  • Common English word: good
  • Common code word: dar
  • Deduction: dar = good.
• Compare Statement 1 and Statement 3:
  • Common English word: you
  • Common code word: na
  • Deduction: na = you.
• Revisit Statement 1 (pit dar na = you are good):
  • Since dar = good and na = you, the only remaining code is pit and the only remaining English word is are.
  • Deduction: pit = are.

By systematically comparing shared elements, you can find the correct word without guessing.

---

Mathematical Operator Substitution and BODMAS Discipline

Operator substitution problems define an alternate meaning for arithmetic symbols (such as $+$ meaning $\times$, and $-$ meaning $\div$). You must substitute the operational symbols into an algebraic expression and calculate the result.

The BODMAS / PEMDAS Order of Operations

Always enforce the strict priority sequence:

1. Brackets
2. Orders (powers, roots)
3. Division and Multiplication (evaluated from left to right)
4. Addition and Subtraction (evaluated from left to right)

Worked Example: If $+$ means $\times$, $-$ means $+$, $\times$ means $\div$, and $\div$ means $-$, compute the value of:

$$24 \times 6 - 8 + 3 \div 5$$

1. Rewrite using the substituted operators:
   • Replace $\times$ with $\div$
   • Replace $-$ with $+$
   • Replace $+$ with $\times$
   • Replace $\div$ with $-$

$$\text{New Expression: } 24 \div 6 + 8 \times 3 - 5$$

1. Execute Division and Multiplication:
   • Division: $24 \div 6 = 4$
   • Multiplication: $8 \times 3 = 24$

$$\text{Expression becomes: } 4 + 24 - 5$$

1. Execute Addition and Subtraction:
   • Addition: $4 + 24 = 28$
   • Subtraction: $28 - 5 = 23$

The Distractor Trap: If a candidate evaluates straight from left to right without BODMAS:

• $24 \div 6 = 4$
• $4 + 8 = 12$
• $12 \times 3 = 36$
• $36 - 5 = 31$ (This incorrect result will appear among the options).

---

Efficient Solving Tactics

1. First-and-Last Letter Screening: Before decoding an entire 7-letter word, decode only the first letter. Inspect the answer choices on your screen; this frequently eliminates two or three options immediately. If two choices remain, decode the final letter to pick the answer.
2. Check for Inversions and Mirror Sums First: If the code letters are from the opposite end of the alphabet (e.g., $A$ turning into $Z$, or $B$ turning into $Y$), immediately apply the 27-sum rule rather than testing forward shifts.
3. Isolate Operator Replacements: Rewrite the converted expression during practice, and in the live test use writing material only if it is permitted.