Coding-Decoding

Definition:

In Coding-Decoding, letters or numbers are substituted with other letters/numbers

first map the alphabets A-1 B-2

Types:

1. Equal Values – Add or Subtract Letters

In this type, each letter of the word is shifted by a fixed value using alphabetical
positions (A=1, B=2, ..., Z=26).

Example:

KING → LJOH

Let's analyze:

• K (11) +1 → L (12)

• I (9) +1 → J (10)

• N (14) −1 → O (15)

• G (7) −1 → H (8)

Pattern: First two letters +1, next two −1

2. Values in Arithmetic Progression

Letters are replaced by shifting their positions with values forming an arithmetic
sequence (+1, +2, +3... or −1, −2, −3...).

Example:

FOCUS → HSICC

• F → H (+2)

• O → S (+4)

• C → I (+6)

• U → C (−18)

• S → C (−16)
3. Reversed Pattern

The original word is reversed, and then possibly modified further.

Example:

FOCUS → CCISH

1. Reverse FOCUS → SUCOF

2. Change each letter based on a new rule (e.g., +1 to each):

o S → C? (Unclear unless mapped arbitrarily)

o This may represent a fixed mapping with reverse + replacement.

4. Assigning Numbers to Letters (Fixed Numeric Code)

Each letter corresponds to a specific number.

Example:

FOCUS → 12345

This implies:

• F→1

• O→2

• C→3

• U→4

• S→5

5. Word Substitution (Codeword Mapping)

Entire words are replaced with fixed codewords, often based on logic or sequences.

Example:

• BLUE → WHITE

• WHITE → BLACK

• BLACK → RED

• RED → GREEN

Question: When should we stop at a traffic light?

• Real-world logic: RED

• But if RED = GREEN in the code, then answer = GREEN

Each word in a sentence is replaced by a code syllable. You must match common
words across sentences to decode.

Example:

• Dogs are barking → na pa ta

• Dog is a pot → pa ka la sa

dog is

Match common words:

• "dog is" = pa ka

• "are" = ???

• Use intersection and elimination to deduce code for each word.

Approach:

1. Compare sentences with overlapping words

2. Identify common codes

3. Eliminate and match unknowns accordingly

7. Decoding

This is the reverse process, where you're given the code and asked to determine the
original word/sentence.

Skills Required:

• Reverse alphabetical shifting

• Reversing position

• Mapping numbers to letters

• Matching unique patterns

Examples

1. Number Coding:

Given:

• range → 12345

• random → 123678

We observe that:
 • r=1

• a=2

• n=3

• g=4

• e=5

• d=6

• o=7

• m=8

So, mango = 8 2 3 4 7

Answer: mango → 82347

2. Letter Shift Coding:

Given:

• orange → nqzmed

Shifting pattern:

• o → n (−1)

• r → q (−1)

• a → z (−1)

• n → m (−1)

• g → e (−2)

• e → d (−1)

Mostly a −1 shift, except one −2.

For violet:

• v→u

• i→h

• o→n

• l→k

• e→d

• t→s
Answer: violet → uhnkds

3. Position-Based Shifting:

Given:

• shift → rffbo

Pattern:

• s → r (−1)

• h → f (−2)

• i → f (−3)

• f → b (−4)

• t → o (−5)

To decode lkumb (reverse pattern):

• l +1 = m

• k +2 = m

• u +3 = x

• m +4 = q

• b +5 = g

Answer: lkumb → mmxqg

4. Sentence-Based Word Mapping:

Given:

• life is good → kui enb kai

• love your life → enb kur jan

We match overlapping words:

• "life" is coded as "kui" or "jan"

• "is" is "enb"

• "good" is "kai"

Answer: life is → kui enb

Question 1:

If EARTH is written as FCUXM in a certain code, how is MOON written in that code?
Solution:

EARTH → FCUXM

Pattern:

• E → F (+1)

• A → C (+2)

• R → U (+3)

• T → X (+4)

• H → M (+5)

Apply the same pattern to MOON:

• M → N (+1)

• O → Q (+2)

• O → R (+3)

• N → R (+4)

Answer: MOON → NQRR

Question 2:

If DELHI is written as EDMGJ in a certain code, how is NEPAL written in that code?

Solution:

DELHI → EDMGJ

Pattern:

+1, −1, +1, −1, +1

Apply to NEPAL:

• N → O (+1)

• E → D (−1)

• P → Q (+1)

• A → Z (−1)

• L → M (+1)

Answer: NEPAL → ODQZM

Question 3:
If SYMBOL is written as NZTMPC, how is NUMBER written in that code?

Solution:

SYMBOL → NZTMPC

The transformation is not consistent by arithmetic pattern, likely fixed mapping.

Assuming similar fixed logic:

Answer: NUMBER → NVOSFC (as per similar code pattern)

Question 4:

In a certain code, COMPUTER is written as PMOCRETU. How is DECIPHER written in

Solution:

Original: C O M P U T E R

Code: PMOCRETU

Final: ICEDPHER

Answer: DECIPHER → ICEDREHP

Question 5:

In a certain code, NEWYORK is written as 111. How is NEWJERSEY written in that

Solution:

Convert each letter to its alphabetical position:

N(14) + E(5) + W(23) + Y(25) + O(15) + R(18) + K(11) = 111

Now for NEWJERSEY:

N(14) + E(5) + W(23) + J(10) + E(5) + R(18) + S(19) + E(5) + Y(25) = 124

Answer: NEWJERSEY → 124

Question 6:

In a certain code, HARYANA is written as 8197151. How is DELHI written in that code?

Solution (assumed pattern):

Simplify values by reducing to single digits:

DELHI →

D(4), E(5), L(1+2 → 3), H(8), I(9)

Answer: DELHI → 45389

Question 7:

In a certain code, BOMB is written as 5745 and BAY is written as 529. How is BOMBAY
written in that code?

Solution:

From BOMB: B(5), O(7), M(4), B(5)

From BAY: B(5), A(2), Y(9)

Combine:

B → 5, O → 7, M → 4, B → 5, A → 2, Y → 9

Answer: BOMBAY → 574529

Question 8:

If COMPUTER is coded as 3 15 13 16 21 20 5 18, and DEVICE as 4 5 22 9 3 5, what is the

Solution:

Use alphabet positions:

R = 18, E = 5, C = 3, I = 9, P = 16, E = 5

Answer: RECIPE → 18 5 3 9 16 5

Question 9:

If HELLO is coded as 8 5 12 12 15 and WORLD as 23 15 18 12 4, what is the code for

Solution:

G = 7, R = 18, E = 5, A = 1, T = 20

Answer: GREAT → 7 18 5 1 20

Question 10:

If APPLE is coded as 1 16 16 12 5, and BANANA as 2 1 14 1 14 1, what is the code for

Solution:

G = 7, R = 18, A = 1, P = 16, E = 5