Directions: A number/word arrangement machine, when given an input line of…
2020
Directions: A number/word arrangement machine, when given an input line of words, rearranges them following a particular rule. The following is an illustration of the input and the steps of rearrangement.
Input: stadium language lunatic ambition condition consonant
Step I: stadium lunatic language consonant condition ambition
Step II: ttadiun munatid manguagf donsonanu donditioo bmbitioo
Step III: adinttu adimntu aafggmnu adnnnoosu ddiinooot bbiimoot
Step IV: bejouuv bejnouv bbghhnov beooopptv eejjopppu ccjjnppu
Step V: bbghhnov bejnouv bejouuv beooopptv ccjjnppu eejjopppu
Step V is the last step of the rearrangement. Applying the same logic, rearrange the given input.
Input: dangerous duplicate murder cannot survive triangle
What will be the LAST STEP for the given input?
- A.
bdfgjmquv befhsva beoopv bffhopsuv bfostv gjsuvww - B.
befgjmquv befhsva beoopv bffhopsuv efostv gjsuvww - C.
cdfgjmquv befhsva beoopv bffhopsuv efostv gjsuvww - D.
bdfgjmquv beoopv bffhopsuv bghjmosv efostv gjsuvww - E.
None of these
Attempted by 2 students.
Show answer & explanation
Correct answer: D
Concept
This is a letter-shift / alphabetical-rearrangement machine. The rule never changes between steps; each step applies one fixed operation to every word, so the safest method is to first DECODE the rule from the illustration, then apply the exact same rule to the new input.
Decoding the rule from the illustration
Step I: the six words are reordered (this ordering does not affect the final letters, so it can be ignored for the last step).
Step II: in each word the first and last letter only are each shifted +1 in the alphabet (a->b, t->u, m->n). Example:
stadium->ttadiun(s->t, m->n).Step III: the letters of each Step-II word are sorted into ascending alphabetical order. Example:
ttadiun->adinttu.Step IV: every letter of the Step-III word is shifted +1. Example:
adinttu->bejouuv.Step V (last step): the Step-IV words are arranged in ascending alphabetical order.
Applying the rule to the new input
Input: dangerous duplicate murder cannot survive triangle. Run each word through II -> III -> IV:
Word | Step II (ends +1) | Step III (sorted) | Step IV (all +1) |
|---|---|---|---|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Last step (Step V): sort the Step-IV words ascending
bdfgjmquv beoopv bffhopsuv bghjmosv efostv gjsuvww
Cross-check
Re-running the illustration's Step IV through the same ascending sort reproduces its given Step V exactly, confirming the rule. Note that Step IV legitimately introduces letters absent from the input (e->f, i->j, p->q) because every letter is shifted +1 — so a string containing f, j or q is NOT automatically invalid; it must instead match the precise word-by-word transformation above.