Directions : Read the following information carefully and answer the following…
2020
Directions : Read the following information carefully and answer the following questions.
A word arrangement machine when given an input line of words rearranges them following a particular rule. The following is an illustration of input and rearrangements.
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 rearrangements, Based on the following logic rearrange the given input.
Input: dangerous duplicate murder cannot survive triangle
What is the position of ‘beoopv’ from left end in Step IV?
- A.
Second
- B.
Third
- C.
Fourth
- D.
Fifth
- E.
None of these
Attempted by 3 students.
Show answer & explanation
Correct answer: E
Concept: This is a multi-step coding-decoding machine puzzle. From ONE fully worked example you must reverse-engineer a fixed chain of rules (how the words get ordered, then how each word's letters get transformed at every step) and then apply that exact same chain, mechanically and in the same order, to the new input — never assume a step's word order or letter pattern without re-deriving it from the example.
Application
Step I orders the six words in DESCENDING (reverse) alphabetical/dictionary order of the whole word — confirmed by comparing every pair in the example letter by letter (e.g. stadium before lunatic before language before consonant before condition before ambition).
Step II shifts only the FIRST and LAST letter of each Step I word one place forward in the alphabet, leaving every middle letter unchanged (stadium -> ttadiun: s->t, m->n, middle 'tadiu' untouched).
Step III sorts the letters of each Step II word in ascending alphabetical order (ttadiun's letters t,t,a,d,i,u,n resorted give adinttu).
Step IV shifts EVERY letter of each Step III word one place forward in the alphabet (adinttu -> bejouuv, each letter +1).
Step V (not needed for this question, but confirms the chain) simply re-sorts the Step IV words into ascending alphabetical order for the final line.
Applying this same four-step chain to the new input dangerous duplicate murder cannot survive triangle:
Step I order | Step II (first+last +1) | Step III (letters sorted) | Step IV (every letter +1) |
|---|---|---|---|
triangle | urianglf | afgilnru | bghjmosv |
survive | turvivf | firtuvv | gjsuvww |
murder | nurdes | denrsu | efostv |
duplicate | euplicatf | acefilptu | bdfgjmquv |
dangerous | eangerout | aeegnortu | bffhopsuv |
cannot | dannou | adnnou | beoopv |
Cross-check: in the worked example every one of the six Step II, Step III and Step IV strings matches the given illustration exactly, and Step V's alphabetical re-sort of the Step IV strings also matches — so Steps II-IV never reorder the words; a word's position in Step IV is exactly its position in Step I. Tracking 'cannot' (the word that produces 'beoopv') through the chain shows it is the LAST of the six Step I words, i.e. the sixth word from the left in Step IV.
Since the offered options only cover Second, Third, Fourth and Fifth — and the sixth position matches none of them — the correct choice is None of these.