Directions : Read the following information carefully and answer the following…

2020

Directions : Read the following information carefully and answer the following questions.
A number 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?

  1. A.

    Second

  2. B.

    Third

  3. C.

    Fourth

  4. D.

    Fifth

  5. E.

    None of these

Attempted by 3 students.

Show answer & explanation

Correct answer: E

Concept

In a letter-arrangement (input/output) machine, you must first DECODE the fixed rule each step applies by comparing the illustration's input with its successive steps, then APPLY that same rule, step by step, to the new input. The rule is constant across both inputs; only the data changes.

Decoding the machine from the illustration

  1. Step I - the six words are reordered into descending (reverse) alphabetical order (stadium, lunatic, language, consonant, condition, ambition).

  2. Step II - in each word the first and last letter are each advanced by +1 (e.g. stadium -> ttadiun).

  3. Step III - the letters of each word are sorted alphabetically (ttadiun -> adinttu).

  4. Step IV - every letter is advanced by +1 (adinttu -> bejouuv). This +1 is why a letter 'a' becomes 'b'.

  5. Step V - the words are sorted into ascending alphabetical order (not needed here).

Applying the rule to the new input

New input: dangerous, duplicate, murder, cannot, survive, triangle.

Step I (descending order): triangle, survive, murder, duplicate, dangerous, cannot.

Now trace the word 'cannot' (it is needed for the target string):

  1. cannot -> Step II (first c->d, last t->u): dannou

  2. dannou -> Step III (sort letters): adnnou

  3. adnnou -> Step IV (+1 each letter): beoopv

So the target string beoopv is the Step IV form of cannot. The earlier idea that 'no input word contains b, so beoopv is impossible' is wrong: Step IV adds +1 to every letter, turning the 'a' in 'adnnou' into 'b'.

Locating its position in Step IV

Step IV keeps the same word order fixed in Step I. Since 'cannot' is alphabetically the smallest of the six words, it sits last - the 6th position - in the descending Step I order, and that position is preserved through Steps II-IV.

Cross-check

Full Step IV row for the new input: bghjmosv (triangle), gjsuvww (survive), efostv (murder), bdfgjmquv (duplicate), bffhopsuv (dangerous), beoopv (cannot). 'beoopv' appears only in the 6th slot, confirming the position.

Result

'beoopv' is at the 6th (sixth) position from the left in Step IV. The choices on offer are only Second, Third, Fourth and Fifth - none of which is the 6th position - so the correct response is None of these.

Explore the full course: Niacl Ao It Specialist