Coding‑Decoding – Logical Reasoning (BITSAT / IIT‑JEE)
Goal – In a coding‑decoding question the exam‑candidate is given a set of “coded” items (letters, numbers, symbols or shapes) and is asked to “decode” one or more of them.
The underlying pattern is deterministic and consistent across the given set.
Success depends on recognizing that pattern quickly and applying it.
Why it matters – These questions exercise pattern‑recognition, deductive reasoning and speed. They are common in BITSAT, IIT‑JEE, GRE, GMAT, UPSC, and many other competitive exams.
1. Core Concepts
| Term | Definition | Example |
|---|---|---|
| Coding | The transformation applied to the original data to obtain the coded value. | A → 1, B → 2, … (simple substitution) |
| Decoding | Reversing the coding to find the original value. | 1 → A, 2 → B, … |
| Mapping | The function f that maps an “original” element x to a “coded” element y (y = f(x)). |
f(x) = (x + 3) mod 26 (shift‑by‑3 cipher) |
| Pattern | The rule(s) that generate the mapping across the entire set. | “Add 2 and then reverse the digits.” |
Key Insight: All coded items are produced by the same mapping. Therefore, if you can determine the mapping from any pair, you can decode any other.
2. Types of Coding‑Decoding Problems
| Category | Typical Pattern | How to Spot It | Common Examples |
|---|---|---|---|
| Alphabetic Substitution | A → 1, B → 2 or A → Z, B → Y |
Look for linear or reverse order. | A → 1, B → 3, C → 5… (odd numbers) |
| Numeric Transformation | 1 → 1, 2 → 4, 3 → 9 |
Square, cube, factorial, primes. | 1 → 1, 2 → 4, 3 → 9… (square) |
| Symbolic/Shape Transformation | ▲ → ● or ○ → △ |
Notice geometry, orientation or size. | ● → ▲, △ → ○ (rotate 90°) |
| Positional/Array Pattern | Matrix rows/columns follow arithmetic or geometric sequences. | Check differences between rows or columns. | 4‑row table of letters where each row is a shift of the previous. |
| Composite Pattern | Combination of two or more operations (e.g., shift + reverse). | Test simple operations first; if not, try combinations. | A → 1, B → 3, C → 5 (add 2 then reverse order). |
| Conditional Pattern | Different operations based on parity, position, or value. | Observe if alternate items follow different rules. | Even positions: add 1; odd positions: subtract 1. |
3. Common Tricks & Formulae
| Operation | Formula (for alphabetic indices 1–26) | Example |
|---|---|---|
| Shift by +k | y = (x + k - 1) mod 26 + 1 |
A (1) → D (4) with k = 3. |
| Shift by –k | y = (x - k - 1) mod 26 + 1 |
D (4) → A (1) with k = 3. |
| Reverse Alphabet | y = 27 - x |
A → Z (27-1=26). |
| Cyclic Reverse | y = 27 - x then shift by +k |
A → Z → C (reverse then shift +2). |
| Mirror within row/column | For a 3‑letter row a b c → c b a |
ABC → CBA. |
| Arithmetic on numeric values | y = ax + b (linear) |
y = 2x + 3. |
| Geometric on numeric values | y = a·x^b |
y = 2x^2. |
| Prime mapping | y = p_x where p_x is the x‑th prime |
1 → 2, 2 → 3, 3 → 5… |
Tip – Always check the first pair. If it yields a simple rule, test it across all pairs. If it fails, try the second pair, etc.
4. Systematic Strategy
| Step | What to Do | Why It Works |
|---|---|---|
| 1. Translate | Convert letters to indices (A=1, B=2, …), numbers to themselves. | Numbers stay numbers; letters become pure integers for arithmetic. |
| 2. Look for simple operations | Add, subtract, multiply, divide, reverse, mirror. | Most exam patterns are simple. |
| **3 |