Examkin

Question

Difficulty: HardCoding and Decoding

In a certain code language, the word CENTRAL is written as AYKEGCM. Based on the same underlying transformation rule, how will the word PRUDENT be written in that code language?

  1. IGIUYKEAnswer
  2. B
    SUSGCQW
  3. C
    MKCYSOI
  4. D
    KIFWVMG

Answer

IGIUYKE
The code is formed by replacing each letter with its reverse alphabetical position value (where A=26, B=25, ..., Z=1), then adding 3 if the value is even or subtracting 2 if it is odd, and finally mapping the resulting number back to the standard 1-26 forward alphabetical index. Applying this process to PRUDENT yields IGIUYKE.

Step-by-Step Solution

1
Analyze the coding rule using the example word CENTRAL
Determine forward and reverse alphabetical positions for each letter: C(3→24), E(5→22), N(14→13), T(20→7), R(18→9), A(1→26), L(12→15).
Identify the positional value system being transformed.
2
Identify the conditional transformation rule applied to the reverse positional values
If reverse position is EVEN, add 3; if ODD, subtract 2. Convert back to standard forward letter: C(24+3=27≡1→A), E(22+3=25→Y), N(13-2=11→K), T(7-2=5→E), R(9-2=7→G), A(26+3=29≡3→C), L(15-2=13→M). This matches AYKEGCM.
Establish the precise pattern rules for decoding target words.
3
Apply the rule to the target word PRUDENT
P(16→11 odd: 11-2=9→I), R(18→9 odd: 9-2=7→G), U(21→6 even: 6+3=9→I), D(4→23 odd: 23-2=21→U), E(5→22 even: 22+3=25→Y), N(14→13 odd: 13-2=11→K), T(20→7 odd: 7-2=5→E).
Generate the coded string systematically letter by letter.

Key Concept

Reverse Alphabetical Indexing with Conditional Numerical Shifting
Estimated Time:2m 0s
Rate this question

Topics

Coding and Decoding

More questions from this topic