Muzammil Quasmi and Jigyasa Sharma Solutions for Exercise 1: CHAPTER EXERCISES - TEST SET

Direction: Following gives the logic of the generation of passcodes for a museum: 
Input: an apple a day keeps doctor away
Step $\mathrm{I}:$ a an apple day keeps doctor away
Step $\mathrm{II}:$ a away an apple day keeps doctor
Step $\mathrm{III}:$ a away doctor an apple day keeps
Step $\mathrm{IV}:$ a away doctor keeps an apple day

If Step $\mathrm{II}$ is 'New York I have never seen till date', then Step $\mathrm{V}$ will be:

Direction: Following gives the logic of the generation of passcodes for a museum: 
Input: an apple a day keeps doctor away
Step $\mathrm{I}:$ a an apple day keeps doctor away
Step $\mathrm{II}:$ a away an apple day keeps doctor
Step $\mathrm{III}:$ a away doctor an apple day keeps

If input is 'life has become dull without you love', what would be the last step?

Direction: Following gives the logic of the generation of passcodes for a museum: 
Input: an apple a day keeps doctor away
Step $\mathrm{I}:$ a an apple day keeps doctor away
Step $\mathrm{II}:$ a away an apple day keeps doctor
Step $\mathrm{III}:$ a away doctor an apple day keeps

If Step $\mathrm{IV}$ is u s r p c a g b, what is the input?

Direction: Following gives the logic of the generation of passcodes for a museum: 
Input: an apple a day keeps doctor away
Step $\mathrm{I}:$ a an apple day keeps doctor away
Step $\mathrm{II}:$ a away an apple day keeps doctor
Step $\mathrm{III}:$ a away doctor an apple day keeps

If input is 'It is not dove but love adding', how many steps are required for the final output?

Following gives an illustration for a word rearranging machine:

Input: within $9 10$ days he left F for T

Step $\mathrm{I}:$ $10$ within $9$ days he left F for T

Step $\mathrm{II}:$ $10$ within $9$ left days he F for T

Step $\mathrm{III}:$ $10$ within $9$ left F days he for T

Step $\mathrm{IV}:$ $10$ within $9$ left F days T he for

Step $\mathrm{V}:$ $10$ within $9$ left F days T for he

(This is the last step for this input)

Using this logic,

Following gives an illustration for a word rearranging machine:

Input: within $9 10$ days he left F for T

Step $\mathrm{I}:$ $10$ within $9$ days he left F for T

Step $\mathrm{II}:$ $10$ within $9$ left days he F for T

Step $\mathrm{III}:$ $10$ within $9$ left F days he for T

Step $\mathrm{IV}:$ $10$ within $9$ left F days T he for

Step $\mathrm{V}:$ $10$ within $9$ left F days T for he

(This is the last step for this input)

Using this logic,

Following gives an illustration for a word rearranging machine:

Input: within $9 10$ days he left F for T

Step $\mathrm{I}:$ $10$ within $9$ days he left F for T

Step $\mathrm{II}:$ $10$ within $9$ left days he F for T

Step $\mathrm{III}:$ $10$ within $9$ left F days he for T

Step $\mathrm{IV}:$ $10$ within $9$ left F days T he for

Step $\mathrm{V}:$ $10$ within $9$ left F days T for he

(This is the last step for this input)

Using this logic,

Following gives an illustration for a word rearranging machine:

Input: within $9 10$ days he left F for T

Step $\mathrm{I}:$ $10$ within $9$ days he left F for T

Step $\mathrm{II}:$ $10$ within $9$ left days he F for T

Step $\mathrm{III}:$ $10$ within $9$ left F days he for T

Step $\mathrm{IV}:$ $10$ within $9$ left F days T he for

Step $\mathrm{V}:$ $10$ within $9$ left F days T for he

(This is the last step for this input)

Using this logic,

If input is 'after $20 30$ defeats amitabh got new chance', how many steps will give you the final output?