CODING-DECODING — Complete Exam Notes

IBPS AFO | IBPS PO/Clerk | SBI PO/Clerk | RRB PO/Clerk | NABARD

1. CORE THEORY

1.1 Definition
• Coding: Converting a word/number/sentence into a specific form (letters, numbers, symbols) using a defined,
consistent rule.
• Decoding: Extracting the original word/message from the coded form by first identifying the rule used.
• Tests: pattern recognition, logical deduction, elimination — not vocabulary or language skill.

1.2 Alphabet Reference (memorize cold — used in every sub-type)

Forward position (A→Z):

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26

• EJOTY shortcut (avoid counting from A every time): E=5, J=10, O=15, T=20, Y=25.
• Backward/reverse position (Z→A): reverse_position = 27 − forward_position.
• Opposite (mirror) letter pairs — pair sum of forward positions = 27:

A-Z B-Y C-X D-W E-V F-U G-T H-S I-R J-Q K-P L-O M-N

1.3 Core Rules / Formulas

• Fixed shift: every letter moves +n or −n positions. Decode by reversing the sign.
• Wrap-around (mod 26): if shifted position > 26 → subtract 26; if < 1 → add 26. (Treat Z=26, and the cycle is
circular.)
• Opposite letter rule: code = 27 − (forward position).
• Reverse-numbering rule: same as opposite-position formula but applied number-wise (Z=1…A=26).
• Word-reversal rule: reverse the letter order of the word before/after applying a shift (shift-then-reverse =
reverse-then-shift when the shift value is constant for all letters).
• Positional/variable shift: shift value changes letter-to-letter following a pattern (+1,+2,+3…; or alternating +a,
−b,+c…). Always test the simplest pattern first (constant shift) before assuming a variable one.
• Common-word/common-code elimination (used in sentence coding): if two coded sentences share exactly
one common word, they must share exactly one common code — that pins one word-code pair.
• Matrix coordinate rule: letter located by (row, column); a stated condition (odd/even row, or vowel/consonant)
decides whether the code is written as (row, col) or (col, row).

1.4 Classification of Coding Types (umbrella view)

1. Letter/Alphabet coding (fixed shift, variable shift, reverse+shift, opposite-letter)
2. Number coding (place value ± arithmetic operation)

Coding-Decoding Complete Exam Notes 1

3. Substitution coding (arbitrary word-for-word/number-for-number replacement, no alphabet logic)
4. Sentence/Phrase coding (deduce word-code mapping from multiple coded sentences)
5. Matrix/Coordinate coding (grid-based fictitious number/letter coding)
6. Conditional/Rule-based coding (multiple sequential conditions applied to a base code)
7. Jumbled/Anagram-based coding (letter-to-code mapping via position matching across scrambled instances)

1.5 Key Terminology

• Forward order / Backward (reverse) order of alphabet
• Opposite/Mirror letter
• Place value (= alphabetical position number)
• Shift/Jump (fixed vs variable)
• Common word – common code elimination method
• Matrix coordinate / row-column code
• Substitution cipher (letter-for-letter or word-for-word)
• Base code (code before conditions are applied, in conditional coding)

Coding-Decoding Complete Exam Notes 2

 2. QUESTION TYPES ASKED (Previous Years)

# Type How to Identify Seen In

IBPS Clerk/PO Prelims, SBI

Clerk Prelims, RRB Office
Every letter of the word shifts by the same fixed value
1 Direct/Fixed Letter Shift Assistant/PO — classic
(forward or backward)
foundational type, still used
as an easy filler

Shift value changes letter-to-letter in a pattern

IBPS PO/Clerk Prelims &
2 Variable/Incremental Shift (+1,+2,+3… or alternating) — differences aren't
Mains, SBI PO Prelims
constant

IBPS PO Mains, SBI PO

Direct shift doesn't match; matches only after
3 Reverse Word + Shift Mains (moderate-high
reversing the word (or the code reads back-to-front)
difficulty)

Opposite/Mirror Letter Code letters look like "flipped" alphabet positions (sum IBPS Clerk/PO Prelims,
4
Coding to 27); sometimes combined with an extra shift RRB PO/Clerk

Word coded as numbers; may be plain position value

Number Coding (Place IBPS PO/Clerk Mains, SBI
5 or with an arithmetic twist (reverse numbering,
Value ± Operation) PO Mains, NABARD
addition, etc.)

IBPS Clerk Prelims, RRB

Substitution/Word "If X is called Y…" — arbitrary renaming, zero Clerk/PO Prelims, SBI Clerk
6 Substitution (Dictionary alphabet logic, purely a memory-chain/GK-linked Prelims — very frequent,
Type) question easy, appears almost every
year somewhere

SBI PO/Clerk Prelims &

3+ coded sentences given; must isolate individual
Sentence/Phrase Coding Mains (since ~2015-16 "new
7 word codes via common-word/common-code
(New Pattern) pattern" era), IBPS PO
elimination
Mains, RRB PO Mains

IBPS Clerk Mains, SBI Clerk

A 5×5 (or 10×10 split) grid of letters/numbers given;
Mains, RRB PO Mains
8 Matrix/Coordinate Coding codes are coordinate pairs; a rule decides row-first or
(newer pattern, moderate-
column-first
high difficulty)

2+ conditions listed, applied in sequence to a base

Conditional/Rule-based IBPS PO Mains (higher-
9 code (vowel/consonant rules, reversal triggers,
(Multi-condition) Coding order sets), SBI PO Mains
doubling rules etc.)

Two or more anagram words given with their codes IBPS PO Mains, SBI PO/
Jumbled/Anagram-based
10 (letters/word same, order scrambled); must match Clerk Mains (occasional
Coding
code to letter by position, not by assumed sequence variant)

AFO-specific note: IBPS AFO reasoning usually draws 3–5 marks from Coding-Decoding, generally weighted
toward Types 1, 5, 6 and 7 (easier–moderate); heavy conditional/matrix sets (8, 9) are rarer here than in PO Mains.

Coding-Decoding Complete Exam Notes 3

 3. EXAMPLES (2 per type, with full solutions)

Type 1 — Direct/Fixed Letter Shift

Example 1 (Standard):
Q: If DELHI is coded as EFMIJ, how is MADRAS coded in the same language?
• Solution: D(4)→E(5): +1; E(5)→F(6): +1; L(12)→M(13): +1; H(8)→I(9): +1; I(9)→J(10): +1. Rule confirmed:
shift +1 for every letter.
• MADRAS: M(13)+1=N(14), A(1)+1=B(2), D(4)+1=E(5), R(18)+1=S(19), A(1)+1=B(2), S(19)+1=T(20).
• Answer: NBESBT

Example 2 (Tricky — backward shift with wrap-around):

Q: If BUS is coded as ZSQ, how is CAR coded?
• Solution: B(2)−2 = 0 → wraps to 26 = Z; U(21)−2=19=S; S(19)−2=17=Q. Rule: shift −2, with wrap-around
for letters near 'A'.
• CAR: C(3)−2=1=A; A(1)−2=−1→ wraps (+26)=25=Y; R(18)−2=16=P.
• Answer: AYP (trap: forgetting that A−2 must wrap around to Y, not go negative)

Type 2 — Variable/Incremental Shift

Example 1 (Standard — increasing shift +1,+2,+3…):

Q: If MOBILE is coded as NQEMQK, what is the code for TABLET?
• Solution: M+1=N, O+2=Q, B+3=E, I+4=M, L+5=Q, E+6=K → shift pattern is +1,+2,+3,+4,+5,+6 (position-
wise increasing).
• TABLET: T(20)+1=U(21), A(1)+2=C(3), B(2)+3=E(5), L(12)+4=P(16), E(5)+5=J(10), T(20)+6=Z(26).
• Answer: UCEPJZ

Example 2 (Tricky — alternating increasing/decreasing shift):

Q: If TRAIN is coded as UPDES using shifts +1,−2,+3,−4,+5 on successive letters, what is the code for
GRAPE using the same pattern?
• Solution check: T(20)+1=U(21)✓, R(18)−2=P(16)✓, A(1)+3=D(4)✓, I(9)−4=E(5)✓, N(14)+5=S(19)✓ →
confirms pattern.
• GRAPE: G(7)+1=H(8), R(18)−2=P(16), A(1)+3=D(4), P(16)−4=L(12), E(5)+5=J(10).
• Answer: HPDLJ (trap: applying the same sign to every letter instead of tracking the alternating pattern)

Coding-Decoding Complete Exam Notes 4

Type 3 — Reverse Word + Shift

Example 1 (Standard):
Q: If TIGER is coded as SFHJU, what is the code for LIONS?
• Solution: Reverse TIGER → REGIT. Shift each letter +1: R+1=S, E+1=F, G+1=H, I+1=J, T+1=U → SFHJU
✓ (rule: reverse the word, then shift +1).
• LIONS reversed → SNOIL. Shift +1 each: S+1=T, N+1=O, O+1=P, I+1=J, L+1=M.
• Answer: TOPJM

Example 2 (Tricky — reverse + variable shift combined):

Q: If HOUSE is coded as FUXSM using reverse-order + increasing shift (+1,+2,+3,+4,+5), what is the code for
MOUSE?
• Solution check: Reverse HOUSE → ESUOH. E+1=F, S+2=U, U+3=X, O+4=S, H+5=M → FUXSM ✓.
• MOUSE reversed → ESUOM. E+1=F, S+2=U, U+3=X, O+4=S, M+5=R.
• Answer: FUXSR (trap: forgetting to reverse the word before applying the increasing shift)

Type 4 — Opposite/Mirror Letter Coding

Example 1 (Standard):
Q: If each letter is replaced by its alphabet-opposite (A↔Z, B↔Y…), how is CAT coded?
• Solution: C(3)→27−3=24=X; A(1)→27−1=26=Z; T(20)→27−20=7=G.
• Answer: XZG

Example 2 (Tricky — opposite letter + extra shift):

Q: If PEN is coded as MXO (opposite letter, then shift +2), what is the code for BOOK?
• Solution check: P(16) opp=11(K), +2=13=M✓; E(5) opp=22(V), +2=24=X✓; N(14) opp=13(M), +2=15=O✓.
• BOOK: B(2) opp=25(Y), +2=27→wrap=1=A; O(15) opp=12(L), +2=14=N (both O's); K(11) opp=16(P),
+2=18=R.
• Answer: ANNR (trap: forgetting the wrap-around when B's opposite+2 crosses 26)

Coding-Decoding Complete Exam Notes 5

Type 5 — Number Coding (Place Value ± Operation)

Example 1 (Standard — plain position value):

Q: If TEACH is written as 20-5-1-3-8, what is the code for LEARN?
• Solution: Direct alphabet position values (T=20, E=5, A=1, C=3, H=8 ✓).
• LEARN: L=12, E=5, A=1, R=18, N=14.
• Answer: 12-5-1-18-14

Example 2 (Tricky — reverse numbering, Z=1…A=26):

Q: If BOLD is coded as 25-12-15-23 (reverse position numbering), what is the code for WORD?
• Solution check: reverse position = 27−forward. B(2)→25✓, O(15)→12✓, L(12)→15✓, D(4)→23✓.
• WORD: W(23)→27−23=4; O(15)→12; R(18)→9; D(4)→23.
• Answer: 4-12-9-23 (trap: using forward position instead of the stated reverse numbering)

Type 6 — Substitution/Word Substitution (Dictionary Type)

Example 1 (Standard):
Q: If 'red' is called 'blue', 'blue' is called 'green', 'green' is called 'yellow', 'yellow' is called 'black', 'black' is called
'white', and 'white' is called 'red' — what is the colour of blood?
• Solution: Blood is naturally red. Since 'red' is renamed 'blue' in this code —
• Answer: Blue

Example 2 (Tricky — arithmetic + substitution combined):

Q: If 5 is called 6, 6 is called 7, 7 is called 8, 8 is called 9, and 9 is called 10, find the value of 5×6−8.
• Solution: Replace each digit with its "called" value: 5→6, 6→7, 8→9. Expression becomes 6×7−9.
• Compute: 6×7=42; 42−9=33.
• Answer: 33 (trap: computing the original expression 5×6−8=22 without substituting first, or substituting only
some digits)

Coding-Decoding Complete Exam Notes 6

Type 7 — Sentence/Phrase Coding (New Pattern)

Example 1 (Standard):
Q: In a code language —
'pen is good' → 'ta ki lo'
'good pen costly' → 'lo ta na'
'good is best' → 'lo ki ru'
What is the code for 'best'?
• Solution:
◦ S2 & S3 share only "good" as common word → common code between {lo,ta,na} and {lo,ki,ru} is "lo" →
good = lo.
◦ S1 remaining: pen, is = {ta, ki}. S3 remaining: is, best = {ki, ru}.
◦ Common word "is" between these two remainders; common code = ki → is = ki.
◦ By elimination: S1 → pen = ta; S3 → best = ru.

• Answer: ru

Example 2 (Tricky — 4 statements, tie-breaking needed):

Q: In a code language —
'time and tide wait' → 'mx pq rs tv'
'tide stops here' → 'rs zt qw'
'wait and here' → 'tv pq qw'
'and only' → 'pq lp'
What is the code for 'and'?
• Solution:
◦ S1 & S2 share only "tide" → common code "rs" → tide = rs.
◦ S2 & S3 share only "here" → common code "qw" → here = qw.
◦ S1 & S3 share "wait" and "and" (two words) → common codes {pq, tv} — ambiguous, cannot resolve
yet.
◦ Tie-breaker: S3 & S4 share only "and" → common code between {tv,pq,qw} and {pq,lp} is "pq" → and
= pq.
◦ This resolves the earlier ambiguity: wait = tv (remaining in S1/S3); only = lp; time = mx (remaining in
S1).

• Answer: pq (this demonstrates the key skill: always hunt for the sentence pair with a single common word
to break ties created by multi-word overlaps)

Type 8 — Matrix/Coordinate Coding

Matrix used for both examples (rows & columns numbered 1–5):

Coding-Decoding Complete Exam Notes 7

 1 2 3 4 5

1 A B C D E

2 F G H I J

3 K L M N O

4 P Q R S T

5 U V W X Y

Rule: Odd-numbered row → code written as (row, column). Even-numbered row → code written as (column, row).

Example 1 (Standard — encode):

Q: Using the matrix and rule above, find the code for GRID.
• Solution: G=row2,col2 → row even → reversed=(2,2). R=row4,col3 → row even → reversed=(3,4).
I=row2,col4 → row even → reversed=(4,2). D=row1,col4 → row odd → direct=(1,4).
• Answer: (2,2)(3,4)(4,2)(1,4)

Example 2 (Tricky — decode, ambiguity resolved by word-validity):

Q: If a 3-letter word is coded as (1,2)(3,5)(3,4), find the word.
• Solution:
◦ Pair (1,2): Direct reading → row1,col2 = B (row1 odd, direct format — consistent). Reversed reading →
actual (2,1) = F (row2 even, so displayed-reversed as (1,2) — also consistent). Both B and F are valid.
◦ Pair (3,5): Direct → row3,col5 = O (row3 odd, consistent). Reversed → actual(5,3) = W, but row5 is odd
and should display direct as (5,3), not (3,5) — inconsistent. Only O is valid.
◦ Pair (3,4): Direct → row3,col4 = N (row3 odd, consistent). Reversed → actual(4,3) = R (row4 even,
displays reversed as (3,4) — consistent). Both N and R are valid.
◦ Possible words: BON, BOR, FON, FOR. Only "FOR" is a real word.

• Answer: FOR (key exam skill: when a coordinate pair is genuinely ambiguous, use word-validity as the
final filter)

Type 9 — Conditional/Rule-based (Multi-condition) Coding

Base rule: Vowels → coded as their alphabet position number. Consonants → coded as the letter immediately
preceding them.
Condition: If the word starts with a consonant and ends with a vowel, reverse the entire code sequence.

Coding-Decoding Complete Exam Notes 8

 Example 1 (Standard):
Q: Code the word TIME using the rule and condition above.
• Solution: T(consonant)→S; I(vowel)→9; M(consonant)→L; E(vowel)→5. Base code: S,9,L,5.
• Check condition: starts with consonant (T) and ends with vowel (E) → TRUE → reverse sequence.
• Answer: 5-L-9-S

Example 2 (Tricky — extra layered condition):

Q: Code the word IDEA using the same base rule, plus this extra condition: "If the word has 3 or more vowels,
double the code of the first vowel." Apply conditions in sequence.
• Solution: I(vowel)→9; D(consonant)→C; E(vowel)→5; A(vowel)→1. Base code: 9,C,5,1.
• Vowel count = 3 (I,E,A) → trigger extra condition: double first vowel's code (I=9 → 18). Updated: 18,C,5,1.
• Check reversal condition: starts with vowel (I), not consonant → condition FALSE → no reversal.
• Answer: 18-C-5-1 (trap: applying conditions out of stated sequence, or applying the reversal condition
without rechecking start/end letters)

Type 10 — Jumbled/Anagram-based Coding

Example 1 (Standard):
Q: If STAR is coded as FRHW, what is the code for TAR?
• Solution: Match position-wise — S(1st)=F, T(2nd)=R, A(3rd)=H, R(4th)=W.
• TAR: T=R, A=H, R=W.
• Answer: RHW

Example 2 (Tricky — cross-verification using an anagram pair):

Q: If CARE is coded as FEUH, and RACE (anagram of CARE) is coded as UEFH, what is the code for A?
• Solution: From CARE (position-wise): C=F, A=E, R=U, E=H.
• Verify with RACE: R(1st)=U ✓, A(2nd)=E ✓, C(3rd)=F ✓, E(4th)=H ✓ — fully consistent, confirms the
mapping.
• Answer: E (key skill: use the second anagram-coded word only to cross-check consistency, not to re-
derive from scratch)

Coding-Decoding Complete Exam Notes 9

 4. TIPS, TRICKS & SHORTCUT METHODS

4.1 Type-wise Shortcuts

Type Shortcut

Find shift using only 1st letter pair, verify with 2nd; apply to rest without recomputation. Use
Fixed shift
EJOTY to skip counting.

Compute position-differences for first 2-3 pairs; check if it's an AP (+1,+2,+3…) or alternating
Variable shift
before assuming complexity.

If direct shift fails on first letter, immediately try matching the last letter of the word to the
Reverse+shift
first letter of the code.

Opposite letter Use 27−n instantly; never count backward from Z manually.

Test the most distinctive/rare letter first (appears once) to quickly confirm forward vs reverse
Number coding
vs operation-based logic.

Draw the chain as A→B→C→… on rough sheet; watch for the chain looping back (circular
Substitution
chains are common).

Always start with the sentence-pair sharing the fewest common words (ideally exactly 1) —
Sentence coding
fastest single-word isolation.

Note the odd/even (or vowel/consonant) rule before touching any letter; for decoding, keep
Matrix coding
word-validity as the tiebreaker.

Apply conditions strictly in the order listed; write down the intermediate code after each
Conditional coding
condition — don't apply all at once.

Match strictly by position within the given instance; never assume the code sequence is
Jumbled/anagram
alphabetical or in word order.

4.2 Common Traps & How to Avoid Them

• Wrap-around blindness: Forgetting the alphabet is circular (Z+1=A, A−1=Z). Always check if a shift crosses
the Z/A boundary.
• Forward vs reverse numbering mix-up: Confusing straight position (A=1) with reverse position (A=26).
Confirm with the given clue before generalizing.
• Assuming code order = word order in sentence coding — WRONG. Always use elimination; never assign
codes by position in the sentence.
• Ignoring the actual question in substitution type — the question often asks a related GK/logic fact (e.g.,
"colour of blood/sky"), not just "what is X called."
• Applying an unverified pattern — always test the hypothesized shift/rule against ALL given letters, not just the
first one, before using it on the answer word.
• Blind rule application in matrix coding — forgetting the odd/even or vowel/consonant condition governs read-
order; applying the same order to every letter.
• Skipping the "simplest hypothesis first" order — always test in this priority: (1) same fixed shift, (2)
reverse+shift, (3) variable shift, (4) opposite letter, before jumping to complex/conditional logic.

Coding-Decoding Complete Exam Notes 10

4.3 Ideal Time Allocation (per question, in exam)

Type Time

Direct/Fixed shift 20–30 sec

Variable shift 40–50 sec

Reverse + shift 40–50 sec

Opposite letter 25–35 sec

Number coding 30–40 sec

Substitution (dictionary) 15–25 sec

Sentence/phrase coding (full 3–5 Q set) 2.5–3.5 min total

Matrix coding (full set) 3–4 min total (incl. ~1 min to internalize rule)

Conditional/multi-condition 60–90 sec

Jumbled/anagram 45–60 sec

5. QUICK REVISION SUMMARY (Cheat Sheet)

Type Core Logic Quick Formula/Trick Time

Verify shift with 1st pair, apply to all;

1. Fixed shift All letters shift by same n 20-30s
mod-26 wrap

2. Variable shift Shift changes per letter (AP/alternating) Diff first 2-3 pairs to detect pattern 40-50s

If direct fails, match last letter↔first

3. Reverse+shift Word reversed, then shifted 40-50s
code letter

4. Opposite letter Code = 27−position (± extra shift) Instant 27−n; check for added shift 25-35s

Position value, plain or reverse (27−n) or w/

5. Number coding Test rarest letter first to detect rule 30-40s
operation

Chain diagram A→B→C; watch

6. Substitution Arbitrary renaming, no alphabet logic 15-25s
circular loop

Common word ↔ common code across Start with pair sharing exactly 1 2.5-3.5 min/
7. Sentence coding
sentences common word set

(row,col) or (col,row) per odd/even or vowel/ Decode ambiguity → resolve via valid
8. Matrix coding 3-4 min/set
consonant rule word

9. Conditional Apply conditions strictly in given order,

Base code + sequential conditions 60-90s
coding one at a time

10. Jumbled/ Match code to letter by position, not Cross-verify using 2nd anagram
45-60s
anagram sequence instance

Coding-Decoding Complete Exam Notes 11

Quick-reference constants: EJOTY = 5,10,15,20,25 | Opposite pair sum = 27 | Mod-26 wrap for any shift crossing
A/Z.
Attack order for unseen questions: Fixed shift → Reverse+shift → Variable shift → Opposite letter → Number/
operation-based → Conditional (only if 2+ rules explicitly stated).

Coding-Decoding Complete Exam Notes 12