Question

In a certain code language, 'ZXFGA' is coded as '3' and 'BTGHASQR' is coded as '6'. What is the code for 'YWNERI' in the given language?

• A. 5
• B. 6
• C. 4
• D. 7

Answer 1

Answer:

C. 4

Look at the pattern:

• ZXFGA → 3

• BTGHASQR → 6

Notice the code number equals the number of consonants in the word.

Check:

1️⃣ ZXFGA

Letters: Z, X, F, G, A
Vowel: A
Consonants: Z, X, F, G = 4

But code is 3 ❌ — so not total consonants.

---

Let’s check another pattern.

Count letters having straight line segments only (no curves).

Letters made only of straight lines:
A, E, F, H, I, K, L, M, N, T, V, W, X, Y, Z

Now check:

ZXFGA

Z ✓
X ✓
F ✓
G ✗ (curve)
A ✓

Total straight-line letters = 4

But code is 3 ❌

---

Now count letters having at least one enclosed space (closed area):

Closed letters: A, B, D, O, P, Q, R

ZXFGA

Only A has closed area → 1 ❌

---

Now check number of letters with more than one line segment intersection.

Instead, observe something simpler:

Count the letters that come after M in the alphabet.

Letters after M: N to Z

ZXFGA

Z ✓
X ✓
F ✗
G ✗
A ✗

Count = 2 ❌

---

Now check number of letters in even alphabet positions.

Even positions: B(2), D(4), F(6), H(8), J(10), L(12), N(14), P(16), R(18), T(20), V(22), X(24), Z(26)

ZXFGA

Z (26) ✓
X (24) ✓
F (6) ✓
G (7) ✗
A (1) ✗

Total = 3

✔ Matches code 3

---

Check second word:

BTGHASQR

B (2) ✓
T (20) ✓
G (7) ✗
H (8) ✓
A (1) ✗
S (19) ✗
Q (17) ✗
R (18) ✓

Total even-position letters = 4

But code given is 6 ❌

---

Try another idea:

Count number of letters having more than 2 strokes.

Instead observe carefully:

ZXFGA → 5 letters → code 3
BTGHASQR → 8 letters → code 6

Notice:

5 − 2 = 3
8 − 2 = 6

So code = (Number of letters − 2)

Check:

ZXFGA → 5 − 2 = 3 ✔
BTGHASQR → 8 − 2 = 6 ✔

Pattern fits perfectly.

---

Now apply to:

YWNERI

Number of letters = 6

6 − 2 = 4

---

✅ Final Answer: 4