Examkin

Question

Difficulty: MediumCoding and Decoding

A global supply chain software tracks cargo shipments by encrypting destination city names to ensure data privacy. In this system, the destination "LONDON" is coded as "OLMFQP" and "BERLIN" is coded as "YVINKP". Based on this coding logic, how will the destination "MUMBAI" be coded in this tracking system?

  1. NFNDCKAnswer
  2. B
    OWODCK
  3. C
    OWOYZR
  4. D
    NFNYZR

Answer

NFNDCK
The coding logic splits the word into two equal halves. The letters in the first half are replaced by their reverse alphabetical counterparts (i.e., A=Z, B=Y, or position 27 - n). The letters in the second half are shifted forward by 2 positions in the alphabet. For 'MUMBAI', the first half 'MUM' becomes 'NFN' through reverse indexing, and the second half 'BAI' becomes 'DCK' through a +2 shift. Combining these yields 'NFNDCK'.

Step-by-Step Solution

1
Analyze the first example "LONDON" -> "OLMFQP" by comparing the alphabetical positions of the letters.
The word is split into two equal halves: "LON" and "DON". 'L' becomes 'O', 'O' becomes 'L', 'N' becomes 'M'. 'D' becomes 'F', 'O' becomes 'Q', 'N' becomes 'P'.
To identify the underlying mathematical transformation rules applied to the letters.
2
Determine the specific logical rules for each half of the word.
For the first half ("LON" -> "OLM"), each letter is replaced by its reverse alphabetical counterpart (e.g., L is the 12th letter from the start, O is 12th from the end; mathematically, 27 - 12 = 15). For the second half ("DON" -> "FQP"), each letter is shifted forward by 2 positions (+2).
To establish a concrete, two-part rule that can be verified and applied.
3
Verify the extracted rules using the second example "BERLIN" -> "YVINKP".
Split into "BER" and "LIN". The reverse alphabetical index of B, E, R gives Y, V, I. Shifting L, I, N forward by 2 gives N, K, P. The rule holds perfectly.
To ensure the pattern is consistent and correct before applying it to the target word.
4
Apply the verified rules to the target word "MUMBAI".
Split into "MUM" and "BAI". Reverse index for MUM: M(13) → N(14), U(21) → F(6), M(13) → N(14). Forward +2 shift for BAI: B(2) → D(4), A(1) → C(3), I(9) → K(11). Combining these halves gives "NFNDCK".
To calculate the final encrypted code based on the established logic.

Key Concept

Identifying split-pattern coding sequences utilizing reverse alphabetical indexing and positional shifts.
Rate this question

Topics

Coding and Decoding

More questions from this topic