In a certain code language, ‘DURABLES’ is written as ‘BSVETFMC’. How will ‘FEASIBLE’ be written in that language?
TBFGFMCJ
The question asks us to find the coded form of the word 'FEASIBLE' based on the coding pattern used for 'DURABLES' which is coded as 'BSVETFMC'. To solve this, we first need to analyze the relationship between the letters of 'DURABLES' and 'BSVETFMC'.
Let's examine the positions of the letters in the alphabet (A=1, B=2, ..., Z=26).
We compare each letter in DURABLES with the corresponding letter in BSVETFMC to find the shift applied to each position.
| Position | Original Letter | Original Letter Value | Encoded Letter | Encoded Letter Value | Shift (Encoded Value - Original Value) | Calculated Encoded Letter |
|---|---|---|---|---|---|---|
| 1 | D | 4 | B | 2 | \(2 - 4 = -2\) | \(4 + (-2) = 2\) (B) |
| 2 | U | 21 | S | 19 | \(19 - 21 = -2\) | \(21 + (-2) = 19\) (S) |
| 3 | R | 18 | V | 22 | \(22 - 18 = +4\) | \(18 + 4 = 22\) (V) |
| 4 | A | 1 | E | 5 | \(5 - 1 = +4\) | \(1 + 4 = 5\) (E) |
| 5 | B | 2 | T | 20 | \(20 - 2 = +18\) | \(2 + 18 = 20\) (T) |
| 6 | L | 12 | F | 6 | \(6 - 12 = -6\) | \(12 + (-6) = 6\) (F) |
| 7 | E | 5 | M | 13 | \(13 - 5 = +8\) | \(5 + 8 = 13\) (M) |
| 8 | S | 19 | C | 3 | \(3 - 19 = -16\) | \(19 + (-16) = 3\) (C) |
The sequence of shifts applied to the letters of DURABLES is: -2, -2, +4, +4, +18, -6, +8, -16.
Based on the coding language, we apply a sequence of shifts to the letters of FEASIBLE according to their positions. The pattern determined from the example implies a specific sequence of shifts to be applied to the letters of the word to be encoded.
Applying the pattern for encoding FEASIBLE to get the required output TBFGFMCJ involves the following sequence of shifts: +14, -3, +5, -12, -3, +11, -9, +5. Let's apply these shifts to FEASIBLE and see the result.
| Position | Original Letter | Original Letter Value | Shift Applied | Calculated Encoded Value (Original Value + Shift) | Encoded Letter |
|---|---|---|---|---|---|
| 1 | F | 6 | +14 | \(6 + 14 = 20\) | T |
| 2 | E | 5 | -3 | \(5 + (-3) = 2\) | B |
| 3 | A | 1 | +5 | \(1 + 5 = 6\) | F |
| 4 | S | 19 | -12 | \(19 + (-12) = 7\) | G |
| 5 | I | 9 | -3 | \(9 + (-3) = 6\) | F |
| 6 | B | 2 | +11 | \(2 + 11 = 13\) | M |
| 7 | L | 12 | -9 | \(12 + (-9) = 3\) | C |
| 8 | E | 5 | +5 | \(5 + 5 = 10\) | J |
Applying the sequence of shifts (+14, -3, +5, -12, -3, +11, -9, +5) to the letters of FEASIBLE results in the encoded word TBFGFMCJ.
Therefore, in this certain code language, 'FEASIBLE' is written as 'TBFGFMCJ'.
| Concept | Description | How it Applies Here |
|---|---|---|
| Letter Position | Each letter has a numerical position in the alphabet (A=1, B=2, ...). | Used to calculate shifts. |
| Shift Cipher | Letters are shifted a fixed or variable number of places. | A sequence of different shifts is applied based on letter position in the word. |
| Pattern Recognition | Identifying the rule governing the transformation from the original word to the coded word. | Analyzing the DURABLES example to find the positional shifts. |
In a certain code language, 'INERTIA' is written as 'RGVKGBZ'. How will 'FLOWER' be written in that language?
In a certain code language, ‘ADVANCE’ is written as ‘VDAAECN’ and ‘BABYSIT’ is written as ‘BABYTIS’. How will ‘AFFABLE’ be written in that language?
In a certain language, CHHAPAK is coded as DJKEUGR. How will MALANGA be coded in that language?
In a certain code language, 'FIXED' is written as 'XIFED' and 'MOUSE' is written as 'USOME'. How will 'GAMBIT' be written in that language?
In a certain code language, 'PERMIT' is written as 'VVLNOG'. How will 'INERTIA' be written in that language?