Coding‑Decoding – UGC NET Reasoning Ability
(UGC NET, Reasoning Section – Coding‑Decoding)
1. Simple Explanation
Coding‑Decoding is a type of analogy or pattern‑recognition problem.
- Coding: A code‑word is mapped to a set of letters, numbers, digits, symbols, or even words.
- Decoding: Using the same mapping, another word is translated into its coded form.
The key is to detect the underlying rule (e.g., “replace each letter with its position in the alphabet”, “shift by 2”, “use a key word”, “reverse order”, etc.) and apply it consistently.
2. Key Points to Remember
| # | Concept | How to Spot | Tips |
|---|---|---|---|
| 1 | Alphabet Position | Mapping 1↔A, 2↔B … 26↔Z | Check if numbers equal letters’ positions. |
| 2 | Caesar/Shift Cipher | Each letter shifted by a fixed number | Look for patterns like ABC → DEF, or reversed. |
| 3 | Reverse Order | Word written backwards | Often “coding” is simply the word reversed. |
| 4 | Key‑Word Mapping | Letters replaced according to a keyword table | Example: KEY “SECRET” → S→1, E→2, C→3 etc. |
| 5 | Positional Operations | Add/subtract position index, multiply, etc. | Check if first letter → 1, second → 2, etc. |
| 6 | Digit‑Letter Conversion | Numbers ↔ letters using a custom table | E.g., 1→A, 2→B, 3→C, 4→D, … |
| 7 | Pattern in Length | Same number of characters or digits | Helps confirm mapping consistency. |
| 8 | Multiple Rules | Combination of the above (e.g., reverse then shift) | Always test simplest rule first. |
| 9 | Use of Vowels/Consonants | Vowels ↔ numbers, consonants ↔ letters | Check if vowels are treated differently. |
| 10 | Consistency Check | Apply rule to all letters → must produce a valid output | If one letter breaks the rule, rule is wrong. |
3. Worked Example
Problem:
Coding of APPLE → 1 5 7 9 16
Decoding of RH → ?
3.1 Find the Rule
- Map each letter to its alphabetical position:
- A → 1
- P → 16 (but appears as 7? Wait: P is 16, not 7.)
- L → 12 (appears as 9?)
- E → 5
So the numbers don’t match direct positions. Try difference from 26:
- 26 – 1 = 25 (not 1).
Try reverse alphabet: - A (1) → 26 → 1? No.
Let’s try “Add 6”:
- A (1) + 6 = 7 (but coded as 1).
Maybe “subtract 15”? - A (1) – 15 = -14 → 12? No.
Observation: The first A maps to 1 (its position).
The last E maps to 5 (its position).
The two P’s map to 7 and 9 respectively.
The L maps to 16.
So the rule could be: Take the alphabetical position, then add the position index of the letter in the word (starting from 0 or 1). Check:
-
A (position 1) + 0 = 1 ✔
-
P (position 16) + 1 = 17 → not 7.
-
P (position 16) + 2 = 18 → not 9.
Maybe subtract the index: -
P (16) – 1 = 15 → not 7.
-
P (16) – 2 = 14 → not 9.
Try “reverse the alphabet”:
- A → 26 → 1?
- P → 11 (since 26-16+1 = 11) → not 7.
Hmm.
Alternate approach: Number of strokes to write the letter in uppercase?
- A = 3 strokes → 1? No.
Maybe the mapping is “Alphabet position of letter’s mirror letter”? Mirror of A is Z (26), not 1.
Let’s try “Mapping by position in word from right to left”:
- Word reversed: E L P P A
- Positions: 1 2 3 4 5
- E (5) → 1? 5-4=1 ✔
- L (12) → 5? 12-7=5? Not.
Ok, let's step back and look at the pattern:
- 1,5,7,9,16
Notice that 1 and 5 are the first and last letters’ positions.
The two middle numbers 7 and 9 are two consecutive odd numbers.
The last number 16 is the position of L (12) + 4? 12+4=16.
The first 1 is 1+0, the last 5 is 5+0.
So rule: Add the letter’s position in the word to its alphabetical position (starting index 0).
Check:
- A (1) + 0 = 1 ✔
- P (16) + 1 = 17 → not 7.
Maybe subtract the index:
- P (16) – 1 = 15 → not 7.
What if we use index from the end?
- A (1) – 4 = -3 → no.
Perhaps the mapping is “position in alphabet of the letter’s successive letter”?
- Next letter after A is B (2) → but coded 1.
It seems this example is ambiguous without the rule. In real tests, the rule is usually simple.
Let's pick a different example that works.
Revised Example
Coding of “BIRD” → “2 9 18 4”
- B → 2
- I → 9
- R → 18
- D → 4
The rule: Alphabetical position of each letter.
Decoding of “13 1 25 5” → ?
- 13 → M
- 1 → A
- 25 → Y