Here you can download a free Input-Output questions PDF with answers for MAH MBA CET 2022 by Cracku. These are some tricky questions in the MAH MBA CET 2022 exam that you need to find the Input-Output of answers for the given questions. These questions will help you to make practice and solve the Input-Output<\/strong>\u00a0questions in the MAH MBA CET exam. Utilize this best PDF practice set<\/strong> which is included answers in detail. Click on the below link to download the Input-Output MCQ<\/strong> PDF for MBA-CET 2022 for free.<\/p>\n Download Input Output Important Questions for MAH-CET<\/a><\/p>\n Enroll to MAH-CET 2022 Crash Course<\/a><\/p>\n Instructions<\/b><\/p>\n Study the following information carefully to answer the questions given below. In a toy exhibition, a machine processes a given input by the following rule. Participants are shown one by one till it reaches its last step. Following is an illustration of the working of this machine. Question 1:\u00a0<\/b>What will be the step IV for the following input? a)\u00a0cry may sen to if not hell<\/p>\n b)\u00a0if not hell to cry may sen<\/p>\n c)\u00a0sen to if may not hell cry<\/p>\n d)\u00a0not hell cry if may sen to<\/p>\n e)\u00a0None of these<\/p>\n 1)\u00a0Answer\u00a0(B)<\/strong><\/p>\n Solution:<\/b><\/p>\n In each step the fourth word becomes first word and the last word becomes fourth word and all other words shift one place rightwards except the third, which shifts two place rightwards.<\/p>\n In order to make things easier, let us represent the words digitally from 1 to 7. Then we have:<\/p>\n Input:<\/b>\u00a0\u00a0 \u00a01 2 3 4 5 6 7 Input : may sen to cry if not hell = 1 2 3 4 5 6 7<\/p>\n Step IV = 5 6 7 3 4 1 2\u00a0:\u00a0if not hell to cry may sen<\/strong><\/p>\n => Ans – (B)<\/p>\n Question 2:\u00a0<\/b>Which of the following correctly describes the \u2018machine logic\u2019 in generating various steps based on the given input?<\/p>\n a)\u00a0Each step is generated on random basis.<\/p>\n b)\u00a0Words\/letters are finally arranged in dictionary order,<\/p>\n c)\u00a0The seventh letter interchanges with the fourth every time.<\/p>\n d)\u00a0Data inadequate<\/p>\n e)\u00a0None of these<\/p>\n 2)\u00a0Answer\u00a0(C)<\/strong><\/p>\n Solution:<\/b><\/p>\n In each step the fourth word becomes first word and the last word becomes fourth word and all other words shift one place rightwards except the third, which shifts two place rightwards.<\/p>\n In order to make things easier, let us represent the words digitally from 1 to 7. Then we have:<\/p>\n Input:<\/b>\u00a0\u00a0 \u00a01 2 3 4 5 6 7 => Ans – (C)<\/p>\n Question 3:\u00a0<\/b>If the Step III of an input is \u2018lo men chi from yet as know\u2019, which of the following would be its input?<\/p>\n a)\u00a0Data inadequate<\/p>\n b)\u00a0from lo men know chi yet as<\/p>\n c)\u00a0men chi yet lo as know from<\/p>\n d)\u00a0chi as know men know from lo<\/p>\n e)\u00a0None of these<\/p>\n 3)\u00a0Answer\u00a0(E)<\/strong><\/p>\n Solution:<\/b><\/p>\n In each step the fourth word becomes first word and the last word becomes fourth word and all other words shift one place rightwards except the third, which shifts two place rightwards.<\/p>\n In order to make things easier, let us represent the words digitally from 1 to 7. Then we have:<\/p>\n Input:<\/b>\u00a0\u00a0 \u00a01 2 3 4 5 6 7 If Step\u00a0III\u00a0:\u00a0\u2018lo men chi from yet as know\u2019 = 6 7 4 5 1 2 3<\/p>\n Then, input = 1 2 3 4 5 6 7\u00a0:\u00a0yet as know chi from lo men<\/strong><\/p>\n => Ans – (E)<\/p>\n Question 4:\u00a0<\/b>If the Step V of an input is \u2018so cd rom lay is nor it\u2019, which of the following would be its Step II ?<\/p>\n a)\u00a0is nor it rom lay so cd<\/p>\n b)\u00a0nor it lay is so cd rom<\/p>\n c)\u00a0lay so cd it rom is nor<\/p>\n d)\u00a0Data inadequate<\/p>\n e)\u00a0None of these<\/p>\n 4)\u00a0Answer\u00a0(A)<\/strong><\/p>\n Solution:<\/b><\/p>\n In each step the fourth word becomes first word and the last word becomes fourth word and all other words shift one place rightwards except the third, which shifts two place rightwards.<\/p>\n In order to make things easier, let us represent the words digitally from 1 to 7. Then we have:<\/p>\n Input:<\/b>\u00a0\u00a0 \u00a01 2 3 4 5 6 7 Now, Step V\u00a0:\u00a0\u2018so cd rom lay is nor it\u2019 = 3 5 6 2 7 4 1<\/p>\n Then, Step\u00a0II = 7 4 1 6 2 3 5\u00a0:\u00a0is nor it rom lay so cd<\/strong><\/p>\n => Ans – (A)<\/p>\n Question 5:\u00a0<\/b>Which of the following steps would read as \u2018not you only say wise yet are\u2019 for the input \u2018say not you are only wise yet\u2019?<\/p>\n a)\u00a0III<\/p>\n b)\u00a0V<\/p>\n c)\u00a0VI<\/p>\n d)\u00a0VII<\/p>\n e)\u00a0None of these<\/p>\n 5)\u00a0Answer\u00a0(C)<\/strong><\/p>\n Solution:<\/b><\/p>\n In each step the fourth word becomes first word and the last word becomes fourth word and all other words shift one place rightwards except the third, which shifts two place rightwards.<\/p>\n In order to make things easier, let us represent the words digitally from 1 to 7. Then we have:<\/p>\n Input:<\/strong>\u00a0\u00a0 \u00a01 2 3 4 5 6 7 Now, input\u00a0:\u00a0\u2018say not you are only wise yet\u2019 = 1 2 3 4 5 6 7<\/p>\n Then\u00a0:\u00a0\u2018not you only say wise yet are\u2019 = 2 3 5 1 6 7 4 = Step VI<\/strong><\/p>\n => Ans – (C)<\/p>\n Take Free MAH-CET mock tests here<\/a><\/strong><\/span><\/p>\n Enroll to 5 MAH CET Latest Mocks For Just Rs. 299<\/a><\/strong><\/span><\/p>\n Instructions<\/b><\/p>\n Study the following information carefully and answer the given questions :<\/p>\n A word and number arrangement machine when given an input line of words and number rearranges them following a particular rule in each step. The following is an illustration of input and rearrangement.<\/p>\n Input : 51 pour 32 start now 23 46 house As per the rules followed in the above steps, find out in each of the following questions the appropriate step for the given input.<\/p>\n Question 6:\u00a0<\/b>Input : milk pot 18 24 over goal 36 53 Which of the following steps will be the last but one?<\/p>\n a)\u00a0VI<\/p>\n b)\u00a0V<\/p>\n c)\u00a0VII<\/p>\n d)\u00a0VIII<\/p>\n e)\u00a0None of these<\/p>\n 6)\u00a0Answer\u00a0(B)<\/strong><\/p>\n Solution:<\/b><\/p>\n The numbers are arranged in increasing order and based on the first letter, the words are arranged in decreasing order alphabetically alternatively.<\/p>\n Input : milk pot 18 24 over goal 36 53<\/p>\n Step\u00a0I :\u00a018\u00a0milk pot 24 over goal 36 53<\/p>\n Step\u00a0II : 18 pot\u00a0milk 24 over goal 36 53<\/p>\n Step III : 18 pot 24\u00a0milk over goal 36 53<\/p>\n Step IV :\u00a018 pot 24\u00a0over milk\u00a0goal 36 53<\/p>\n Step V :\u00a018 pot 24\u00a0over\u00a036\u00a0milk\u00a0goal 53<\/p>\n Step VI :\u00a018 pot 24\u00a0over\u00a036\u00a0milk 53 goal<\/p>\n $\\therefore$ 5th step is the second last step.<\/p>\n Question 7:\u00a0<\/b>Step II of an input is : 16 victory 19 36 53 store lake town Which of the following will be step V?<\/p>\n a)\u00a016 victory 19 town store 36 53 lake<\/p>\n b)\u00a016 victory 19 town 36 store 53 lake<\/p>\n c)\u00a016 victory 19 town 36 53 store lake<\/p>\n d)\u00a0There will be no such step.<\/p>\n e)\u00a0None of these<\/p>\n 7)\u00a0Answer\u00a0(D)<\/strong><\/p>\n Solution:<\/b><\/p>\n The numbers are arranged in increasing order and based on the first letter, the words are arranged in decreasing order alphabetically alternatively.<\/p>\n Step II :\u00a016 victory 19 36 53 store lake town<\/p>\n Step III : 16 victory 19 town\u00a036 53 store lake<\/p>\n Step IV :\u00a016 victory 19 town\u00a036\u00a0store 53 lake<\/p>\n Step IV is the final step. There is no 5th step.<\/p>\n => Ans – (D)<\/p>\n Question 8:\u00a0<\/b>Input : nice flower 34 12 costly height 41 56 Which of the following will be step III?<\/p>\n a)\u00a012 nice 34 height flower costly 41 56<\/p>\n b)\u00a012 nice 34 height 41 flower costly 56<\/p>\n c)\u00a012 nice 34 flower costly height 41 56<\/p>\n d)\u00a012 nice flower 34 costly height 41 56<\/p>\n e)\u00a0None of these<\/p>\n 8)\u00a0Answer\u00a0(A)<\/strong><\/p>\n Solution:<\/b><\/p>\n The numbers are arranged in increasing order and based on the first letter, the words are arranged in decreasing order alphabetically alternatively.<\/p>\n Input : nice flower 34 12 costly height 41 56<\/p>\n Step I : 12\u00a0nice flower 34 costly height 41 56<\/p>\n Step II : 12 nice 34 flower costly height 41 56<\/p>\n Step III :\u00a012 nice 34\u00a0height\u00a0flower\u00a0costly 41 56<\/p>\n => Ans – (A)<\/p>\n Question 9:\u00a0<\/b>Step II of an input is : 18 task bear cold dish 81 63 31 How many more steps will be required to complete the rearrangement?<\/p>\n a)\u00a0Three<\/p>\n b)\u00a0Four<\/p>\n c)\u00a0Five<\/p>\n d)\u00a0Six<\/p>\n e)\u00a0None of these<\/p>\n 9)\u00a0Answer\u00a0(C)<\/strong><\/p>\n Solution:<\/b><\/p>\n The numbers are arranged in increasing order and based on the first letter, the words are arranged in decreasing order alphabetically alternatively.<\/p>\n Step II :\u00a018 task bear cold dish 81 63 31<\/p>\n Step III : 18 task 31\u00a0bear cold dish 81 63<\/p>\n Step IV :\u00a018 task 31\u00a0dish\u00a0bear cold 81 63<\/p>\n Step V :\u00a018 task 31\u00a0dish\u00a063\u00a0bear cold 81<\/p>\n Step VI : 18 task 31\u00a0dish\u00a063\u00a0cold bear 81<\/p>\n Step VII :\u00a018 task 31\u00a0dish\u00a063\u00a0cold 81 bear<\/p>\n Step VII is the final step. Thus, after 2nd step, five more steps required to complete the arrangement.<\/p>\n => Ans – (C)<\/p>\n Instructions<\/b><\/p>\n Study the following information carefully and answer the questions given below : Input : 10 sea 25 57 41 rose giraffe 85 hot 32 lost 77 99 beard cost palm Question 10:\u00a0<\/b>Which word\/number would be third to the left of the sixth element from the right in the Step III?<\/p>\n a)\u00a0dawn<\/p>\n b)\u00a055<\/p>\n c)\u00a0chip<\/p>\n d)\u00a0slip<\/p>\n e)\u00a062<\/p>\n 10)\u00a0Answer\u00a0(E)<\/strong><\/p>\n Solution:<\/b><\/p>\n The pattern here followed is that in step I, the smallest number is written first and the largest number is written at last place, and similarly, the word with the smallest first letter (alphabetically) is written after the number in 2nd place and the largest is written at 2nd last place.<\/p>\n Input : 31 11 win arm blanket zebra 24 81 chip team slip 62 55 dawn 91 78<\/p>\n Step\u00a0I :\u00a011 arm 31 win blanket 24 81 chip team slip 62 55 dawn 78 zebra 91<\/p>\n Step II\u00a0: 11 24 arm blanket 31 chip team slip 62 55 dawn 78 win zebra 81 91<\/p>\n Step III :\u00a011 24 31 arm blanket chip\u00a0slip 62 55 dawn\u00a0team\u00a0win zebra 78 81 91<\/p>\n Step IV :\u00a011 24 31 55 arm blanket chip\u00a0dawn slip team\u00a0win zebra 62 78 81 91<\/p>\n => 6th element from the right in the Step III = ‘team’<\/p>\n $\\therefore$ 3rd element to the left of ‘team’ = ’62’<\/p>\n => Ans – (E)<\/p>\n Question 11:\u00a0<\/b>At which of the following position “dawn” would appear from the right in the Step III?<\/p>\n a)\u00a0Tenth<\/p>\n b)\u00a0Ninth<\/p>\n c)\u00a0Seventh<\/p>\n d)\u00a0Fifth<\/p>\n e)\u00a0Eighth<\/p>\n 11)\u00a0Answer\u00a0(C)<\/strong><\/p>\n Solution:<\/b><\/p>\n The pattern here followed is that in step I, the smallest number is written first and the largest number is written at last place, and similarly, the word with the smallest first letter (alphabetically) is written after the number in 2nd place and the largest is written at 2nd last place.<\/p>\n Input : 31 11 win arm blanket zebra 24 81 chip team slip 62 55 dawn 91 78<\/p>\n Step\u00a0I :\u00a011 arm 31 win blanket 24 81 chip team slip 62 55 dawn 78 zebra 91<\/p>\n Step II\u00a0: 11 24 arm blanket 31 chip team slip 62 55 dawn 78 win zebra 81 91<\/p>\n Step III :\u00a011 24 31 arm blanket chip\u00a0slip 62 55 dawn\u00a0team\u00a0win zebra 78 81 91<\/p>\n Step IV :\u00a011 24 31 55 arm blanket chip\u00a0dawn slip team\u00a0win zebra 62 78 81 91<\/p>\n => Position of ‘dawn’ from right end in step III = ‘7th’<\/p>\n => Ans – (C)<\/p>\n Question 12:\u00a0<\/b>Which element (word\/number) would be at the ninth position from the left in the Step II?<\/p>\n a)\u00a062<\/p>\n b)\u00a0slip<\/p>\n c)\u00a055<\/p>\n d)\u00a0team<\/p>\n e)\u00a0dawn<\/p>\n 12)\u00a0Answer\u00a0(A)<\/strong><\/p>\n Solution:<\/b><\/p>\n The pattern here followed is that in step I, the smallest number is written first and the largest number is written at last place, and similarly, the word with the smallest first letter (alphabetically) is written after the number in 2nd place and the largest is written at 2nd last place.<\/p>\n Input : 31 11 win arm blanket zebra 24 81 chip team slip 62 55 dawn 91 78<\/p>\n Step\u00a0I :\u00a011 arm 31 win blanket 24 81 chip team slip 62 55 dawn 78 zebra 91<\/p>\n Step II\u00a0: 11 24 arm blanket 31 chip team slip 62 55 dawn 78 win zebra 81 91<\/p>\n Step III :\u00a011 24 31 arm blanket chip\u00a0slip 62 55 dawn\u00a0team\u00a0win zebra 78 81 91<\/p>\n Step IV :\u00a011 24 31 55 arm blanket chip\u00a0dawn slip team\u00a0win zebra 62 78 81 91<\/p>\n => Element\u00a0at the ninth position from the left in the Step II = ’62’<\/p>\n => Ans – (A)<\/p>\n Question 13:\u00a0<\/b>How many elements (words\/ numbers) are there between “dawn” and “81” as they appear in Step IV?<\/p>\n a)\u00a0Five<\/p>\n b)\u00a0Six<\/p>\n c)\u00a0Seven<\/p>\n d)\u00a0Four<\/p>\n e)\u00a0Eight<\/p>\n 13)\u00a0Answer\u00a0(B)<\/strong><\/p>\n Solution:<\/b><\/p>\n The pattern here followed is that in step I, the smallest number is written first and the largest number is written at last place, and similarly, the word with the smallest first letter (alphabetically) is written after the number in 2nd place and the largest is written at 2nd last place.<\/p>\n Input : 31 11 win arm blanket zebra 24 81 chip team slip 62 55 dawn 91 78<\/p>\n Step\u00a0I :\u00a011 arm 31 win blanket 24 81 chip team slip 62 55 dawn 78 zebra 91<\/p>\n Step II\u00a0: 11 24 arm blanket 31 chip team slip 62 55 dawn 78 win zebra 81 91<\/p>\n Step III :\u00a011 24 31 arm blanket chip\u00a0slip 62 55 dawn\u00a0team\u00a0win zebra 78 81 91<\/p>\n Step IV :\u00a011 24 31 55 arm blanket chip\u00a0dawn slip team\u00a0win zebra 62 78 81 91<\/p>\n => Elements\u00a0between “dawn” and “81” as they appear in Step IV = 6<\/p>\n => Ans – (B)<\/p>\n Question 14:\u00a0<\/b>Which of the following represents the position of “slip” in the Step III?<\/p>\n a)\u00a0Ninth from right<\/p>\n b)\u00a0Eighth from left<\/p>\n c)\u00a0Eighth from right<\/p>\n d)\u00a0Seventh from left<\/p>\n e)\u00a0Sixth from left<\/p>\n 14)\u00a0Answer\u00a0(D)<\/strong><\/p>\n Solution:<\/b><\/p>\n The pattern here followed is that in step I, the smallest number is written first and the largest number is written at last place, and similarly, the word with the smallest first letter (alphabetically) is written after the number in 2nd place and the largest is written at 2nd last place.<\/p>\n Input : 31 11 win arm blanket zebra 24 81 chip team slip 62 55 dawn 91 78<\/p>\n Step\u00a0I :\u00a011 arm 31 win blanket 24 81 chip team slip 62 55 dawn 78 zebra 91<\/p>\n Step II\u00a0: 11 24 arm blanket 31 chip team slip 62 55 dawn 78 win zebra 81 91<\/p>\n Step III :\u00a011 24 31 arm blanket chip\u00a0slip 62 55 dawn\u00a0team\u00a0win zebra 78 81 91<\/p>\n Step IV :\u00a011 24 31 55 arm blanket chip\u00a0dawn slip team\u00a0win zebra 62 78 81 91<\/p>\n => Position of “slip” in the Step III = 7th from left end<\/p>\n => Ans – (D)<\/p>\n Instructions<\/b><\/p>\n A word and number arrangement machine when given an input line of words and numbers rearranges them following a particular rule in each step. The following is an illustration of input and rearrangement. Question 15:\u00a0<\/b>Input : shower fall water 34 51 67 98 goal How many steps will be required to complete the rearrangement ?<\/p>\n a)\u00a0Three<\/p>\n b)\u00a0Four<\/p>\n c)\u00a0Six<\/p>\n d)\u00a0Five<\/p>\n e)\u00a0None of these<\/p>\n 15)\u00a0Answer\u00a0(D)<\/strong><\/p>\n Solution:<\/b><\/p>\n The pattern here is in the first step the word with the largest first letter alphabetically is arranged at first position. In the second step, the highest number is placed at second position and so on.<\/p>\n Input : shower fall water 34 51 67 98 goal<\/p>\n Step I : water\u00a0shower fall 34 51 67 98 goal<\/p>\n Step II : water 98 shower fall 34 51 67 goal<\/p>\n Step III :\u00a0water 98\u00a0shower 67 fall 34 51 goal<\/p>\n Step IV :\u00a0water 98\u00a0shower 67\u00a0goal\u00a0fall 34 51<\/p>\n Step V :\u00a0water 98\u00a0shower 67\u00a0goal\u00a051\u00a0fall 34<\/p>\n Step V is the last step of the arrangement.<\/p>\n => Ans – (D)<\/p>\n Question 16:\u00a0<\/b>Step II of an input is : war 58 box cart 33 49 star 24 Which of the following steps will be the last ?<\/p>\n a)\u00a0V<\/p>\n b)\u00a0VI<\/p>\n c)\u00a0IV<\/p>\n d)\u00a0VII<\/p>\n e)\u00a0None of these<\/p>\n 16)\u00a0Answer\u00a0(B)<\/strong><\/p>\n Solution:<\/b><\/p>\n The pattern here is in the first step the word with the largest first letter alphabetically is arranged at first position. In the second step, the highest number is placed at second position and so on.<\/p>\n Step II of an input is : war 58 box cart 33 49 star 24<\/p>\n Step III : war 58 star\u00a0box cart 33 49 24<\/p>\n Step IV :\u00a0war 58 star\u00a049\u00a0box cart 33 24<\/p>\n Step V :\u00a0war 58 star\u00a049\u00a0cart box 33 24<\/p>\n Step\u00a0VI : war 58 star\u00a049\u00a0cart 33 box 24<\/p>\n Step VI is the last step of the rearrangement.<\/p>\n => Ans – (B)<\/p>\n Question 17:\u00a0<\/b>Input : play over 49 37 12 match now 81 Which of the following will be step IV ?<\/p>\n a)\u00a0play 81 over 49 37 match now<\/p>\n b)\u00a0play 81 over 49 37 12 match now<\/p>\n c)\u00a0play 81 over 49 now 37 match 12<\/p>\n d)\u00a0There will be no such step<\/p>\n e)\u00a0None of these<\/p>\n 17)\u00a0Answer\u00a0(D)<\/strong><\/p>\n Solution:<\/b><\/p>\n The pattern here is in the first step the word with the largest first letter alphabetically is arranged at first position. In the second step, the highest number is placed at second position and so on.<\/p>\n Input : play over 49 37 12 match now 81<\/p>\n Step I : play 81\u00a0over 49 37 12 match now<\/p>\n Step II : play 81 over 49 now 37 12 match<\/p>\n Step III : play 81 over 49 now 37 match 12<\/p>\n Step III is the last step of the rearrangement. Hence, there is no step IV.<\/p>\n => Ans – (D)<\/p>\n Question 18:\u00a0<\/b>Step II of an input is : town 74 pair 15 31 nice job 42 Which of the following is definitely the input ?<\/p>\n a)\u00a0pair 15 31 town nice job 42 74<\/p>\n b)\u00a0pair 15 town 31 74 nice job 42<\/p>\n c)\u00a0pair 15 town 74 31 nice job 42<\/p>\n d)\u00a0Cannot be determined<\/p>\n e)\u00a0None of these<\/p>\n 18)\u00a0Answer\u00a0(D)<\/strong><\/p>\n Solution:<\/b><\/p>\n The pattern here is in the first step the word with the largest first letter alphabetically is arranged at first position. In the second step, the highest number is placed at second position and so on.<\/p>\n Step II of an input is : town 74 pair 15 31 nice job 42<\/p>\n We cannot determine the input as the position of ‘town’ and ’74’ can be anywhere in the input.<\/p>\n => Ans – (D) : Cannot be determined.<\/p>\n Question 19:\u00a0<\/b>Input : any how 49 24 far wide 34 69 Which of the following steps will be the last but one ?<\/p>\n a)\u00a0VI<\/p>\n b)\u00a0VII<\/p>\n c)\u00a0V<\/p>\n d)\u00a0VIII<\/p>\n e)\u00a0None of these<\/p>\n 19)\u00a0Answer\u00a0(C)<\/strong><\/p>\n Solution:<\/b><\/p>\n The pattern here is in the first step the word with the largest first letter alphabetically is arranged at first position. In the second step, the highest number is placed at second position and so on.<\/p>\n Input : any how 49 24 far wide 34 69<\/p>\n Step I : wide\u00a0any how 49 24 far 34 69<\/p>\n Step II : wide 69\u00a0any how 49 24 far 34<\/p>\n Step III : wide 69 how any\u00a049 24 far 34<\/p>\n Step IV :\u00a0wide 69 how\u00a049 any\u00a024 far 34<\/p>\n Step V :\u00a0wide 69 how\u00a049\u00a0far any 24 34<\/p>\n Step VI : wide 69 how\u00a049\u00a0far 34 any 24<\/p>\n Step VI is the last step of the rearrangement. Thus step V is the last but one step.<\/p>\n => Ans – (C)<\/p>\n Question 20:\u00a0<\/b>Step III of an input is : year 92 ultra 15 23 strive house 39 How many more steps will be required to complete the rearrangement ?<\/p>\n a)\u00a0Three<\/p>\n b)\u00a0Four<\/p>\n c)\u00a0Two<\/p>\n d)\u00a0Five<\/p>\n e)\u00a0None of these<\/p>\n 20)\u00a0Answer\u00a0(B)<\/strong><\/p>\n Solution:<\/b><\/p>\n The pattern here is in the first step the word with the largest first letter alphabetically is arranged at first position. In the second step, the highest number is placed at second position and so on.<\/p>\n Step III of an input is : year 92 ultra 15 23 strive house 39<\/p>\n Step IV :\u00a0year 92 ultra\u00a039\u00a015 23 strive house<\/p>\n Step V :\u00a0year 92 ultra\u00a039\u00a0strive 15 23 house<\/p>\n Step VI : year 92 ultra\u00a039\u00a0strive 23 15 house<\/p>\n Step VII : year 92 ultra\u00a039\u00a0strive 23 house 15<\/p>\n Step VII is the final step of the rearrangement. Thus, after step III, 4 more steps are required\u00a0to complete the rearrangement.<\/p>\n => Ans – (B)<\/p>\n
\nInput : sui me ato fe zen u no
\nStep I : fe sui me no ato zen u
\nStep II : no fe sui u me ato zen
\nStep III: u no fe zen sui me ato
\nStep IV: zen u no ato fe sui me
\nStep V : ato zen u me no fe sui<\/p>\n
\nInput: may sen to cry if not hell<\/p>\n
\nStep I:<\/b>\u00a0\u00a0 \u00a04 1 2 7 3 5 6
\nStep II:<\/b>\u00a0\u00a0 7 4 1 6 2 3 5
\nStep III:<\/b>\u00a0\u00a06 7 4 5 1 2 3
\nStep IV:<\/b>\u00a0\u00a05 6 7 3 4 1 2
\nStep V:<\/b>\u00a0\u00a0 3 5 6 2 7 4 1
\nStep VI:<\/b>\u00a0\u00a02 3 5 1 6 7 4<\/p>\n
\nStep I:<\/b>\u00a0\u00a0 \u00a04 1 2 7 3 5 6
\nStep II:<\/b>\u00a0\u00a0 7 4 1 6 2 3 5
\nStep III:<\/b>\u00a0\u00a06 7 4 5 1 2 3
\nStep IV:<\/b>\u00a0\u00a05 6 7 3 4 1 2
\nStep V:<\/b>\u00a0\u00a0 3 5 6 2 7 4 1
\nStep VI:<\/b>\u00a0\u00a02 3 5 1 6 7 4<\/p>\n
\nStep I:<\/b>\u00a0\u00a0 \u00a04 1 2 7 3 5 6
\nStep II:<\/b>\u00a0\u00a0 7 4 1 6 2 3 5
\nStep III:<\/b>\u00a0\u00a06 7 4 5 1 2 3
\nStep IV:<\/b>\u00a0\u00a05 6 7 3 4 1 2
\nStep V:<\/b>\u00a0\u00a0 3 5 6 2 7 4 1
\nStep VI:<\/b>\u00a0\u00a02 3 5 1 6 7 4<\/p>\n
\nStep I:<\/b>\u00a0\u00a0 \u00a04 1 2 7 3 5 6
\nStep II:<\/b>\u00a0\u00a0 7 4 1 6 2 3 5
\nStep III:<\/b>\u00a0\u00a06 7 4 5 1 2 3
\nStep IV:<\/b>\u00a0\u00a05 6 7 3 4 1 2
\nStep V:<\/b>\u00a0\u00a0 3 5 6 2 7 4 1
\nStep VI:<\/b>\u00a0\u00a02 3 5 1 6 7 4<\/p>\n
\nStep I:<\/strong>\u00a0\u00a0 \u00a04 1 2 7 3 5 6
\nStep II:<\/strong>\u00a0\u00a0 7 4 1 6 2 3 5
\nStep III:<\/strong>\u00a0\u00a06 7 4 5 1 2 3
\nStep IV:<\/strong>\u00a0\u00a05 6 7 3 4 1 2
\nStep V:<\/strong>\u00a0\u00a0 3 5 6 2 7 4 1
\nStep VI:<\/strong>\u00a0\u00a02 3 5 1 6 7 4<\/p>\n
\nStep I : 23 51 pour 32 start now 46 house
\nStep II : 23 start 51 pour 32 now 46 house
\nStep III : 23 start 32 51 pour now 46 house
\nStep IV : 23 start 32 pour 51 now 46 house
\nStep V : 23 start 32 pour 46 51 now house
\nStep VI: 23 start 32 pour 46 now 51 house<\/p>\n
\nA word and number arrangement machine when given an input line of words and numbers rearranges them following a particular rule in each step. The following is an illustration of input and various steps of rearrangement. (All the numbers are two digit numbers).<\/p>\n
\nStep I : 10 beard 25 57 41 rose giraffe 85 hot 32 lost 77 cost palm sea 99
\nStep II : 10 25 beard cost 57 41 giraffe hot 32 lost 77 palm rose sea 85 99
\nStep III : 10 25 32 beard cost giraffe 57 41 hot lost palm rose sea 77 85 99
\nStep IV : 10 25 32 41 beard cost giraffe hot lost palm rose sea 57 77 85 99
\nAnd Step IV is the last step of the rearrangement as the desired arrangement is obtained. As per rules followed in the above steps, nd out in each of the questions the appropriate step for the given input.
\nInput : 31 11 win arm blanket zebra 24 81 chip team slip 62 55 dawn 91 78<\/p>\n
\nInput :
\nbut 32 71 glory fair south 65 84
\nStep I : south but 32 71 glory fair 65 84
\nStep II : south 84 but 32 71 glory fair 65
\nStepIll : south 84 glory but 32 71 fair 65
\nStepIV : south 84 glory 71 but 32 fair 65
\nStepV : south 84 glory 71 fair but 32 65
\nStepVl : south 84 glory 71 fair 65 but 32
\nand Step VI is the last step of the rearrangement.
\nAs per the rules followed in the above steps, nd out in each of the following questions the appropriate step for the given input.<\/p>\n