Practice30Create account

A word-arrangement machine arranges words in reverse alphabetical order (Z to A), moving one word per step to the left. Example — Input: apple mango cherry; Step 1: mango apple cherry; Step 2: mango cherry apple. For Input: fig date grape berry, what is Step 1?

Competition practiceInput-Output
  • Agrape date fig berry
  • Bgrape berry date fig
  • Cgrape fig date berry
  • Dfig grape date berry

Step-by-Step Solution

In reverse order 'grape' comes first, so Step 1 moves it to the front while the rest keep their order: grape fig date berry.
Answer: C) grape fig date berry

Master this topic in 30 minutes a day.

Don't just memorise the answer — build a daily practice habit.

Practice 5 Similar Questions Free →

All Input-Output practice questions

More Input-Output practice

A number-arrangement machine, in each step, shifts the largest number among the…A machine rearranges numbers: in each step it brings the smallest not-yet-placed number…A word machine works so that in each step the word coming last in alphabetical order…A machine brings, in each step, the smallest not-yet-placed number to the leftmost…A machine brings, in each step, the largest not-yet-placed number to the leftmost…