send mail to support@abhimanu.com mentioning your email id and mobileno registered with us! if details not recieved
Resend Opt after 60 Sec.
By Loging in you agree to Terms of Services and Privacy Policy
Claim your free MCQ
Please specify
Sorry for the inconvenience but we’re performing some maintenance at the moment. Website can be slow during this phase..
Please verify your mobile number
Login not allowed, Please logout from existing browser
Please update your name
Subscribe to Notifications
Stay updated with the latest Current affairs and other important updates regarding video Lectures, Test Schedules, live sessions etc..
Your Free user account at abhipedia has been created.
Remember, success is a journey, not a destination. Stay motivated and keep moving forward!
Refer & Earn
Enquire Now
My Abhipedia Earning
Kindly Login to view your earning
Support
Type your modal answer and submitt for approval
Direction: Study the following information and answer the question given below:
An alphabetical machine, when given an input of words rearranges them following a particular rule in each step. The following is an illustration of input and step of rearrangement. INPUT: COVER LAYER MINIMUM CONTROL AMAZE UNIQUE INITIAL ENTER FINAL EXIT
Step I: COVER LAYER MINIMUM CONTROL AMAZE INITIAL ENTER FINAL
Step II: COVER LAYER MINIMUM CONTROL FINAL
Step III: CONTROL COVER FINAL LAYER MINIMUM
Step IV: COVER FINAL LAYER CONTROL MINIMUM
Step IV is the final step of the arrangement
NPUT: FILES GRADE INSIDE AWARE ADVANCE PAIRS FOREIGN ALTER OVER TOWARDS
How many words start with a vowel in Step III?
One
Two
Three
Four
None
Alright, let’s get straight to it. Let's take your input:
INPUT:
FILES GRADE INSIDE AWARE ADVANCE PAIRS FOREIGN ALTER OVER TOWARDS
Here's how the original example works:
- Step I: Removes words starting with a vowel except the last one, moves up initials/enters/finals, etc.
- Step II: More removals, reducing size.
- Step III: Reorders words to group similar starting letters or follows a certain alphabetical pattern.
- Step IV: Final, reduced set.
Now, let's break your input down by vowel starters.
Words starting with a vowel:
- INSIDE
- AWARE
- ADVANCE
- ALTER
- OVER
Let's follow the transformation pattern.
- In the sample, Step I removes most vowel-starters except maybe the first noninitial one; by Step II, vowels are further thinned.
- By Step III, the words left are the core group, almost all with consonant starts.
If you follow this logic, most vowel-starters are likely removed by Step III.
Back to your question:
You answered: Option 5: None
Let’s spell out the options:
- Option 1: One
- Option 2: Two
- Option 3: Three
- Option 4: Four
- Option 5: None
Here’s what really matters:
- By Step III, the machine almost always chucks out the vowel-starters.
- Since your input has 5 vowel-starters, by the established pattern, none make it to Step III.
Option 5: None is the right answer.
Quick summary in plain English:
- The machine strips vowel-starters by Step III.
- Only consonant-starters survive.
- So, there are zero vowel-starters in Step III.
- Your choice? Spot on.
By: Parvesh Mehta ProfileResourcesReport error
Access to prime resources
New Courses