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
Which word is third from left in Step II?
GRADE
PAIRS
FOREIGN
TOWARDS
None
Let’s break this down step by step. The question is all about figuring out what happens to a string of words when you push them through a “machine” that follows a hidden pattern.
First, spotting the rule:
- In the illustration, Step I and Step II knock out some words. By looking closely, you can see the pattern: remove words that start with vowels in each move until none are left.
- After all vowel-beginning words are out, the rest are rearranged in alphabetical order for the final steps.
Let’s apply this to your input:
- INPUT: FILES GRADE INSIDE AWARE ADVANCE PAIRS FOREIGN ALTER OVER TOWARDS
Step I:
- Remove words starting with a vowel: INSIDE, AWARE, ADVANCE, ALTER, OVER
- Left: FILES GRADE PAIRS FOREIGN TOWARDS
Step II:
- No words left that start with a vowel, so Step II is just: FILES GRADE PAIRS FOREIGN TOWARDS
Now, the question: Which word is third from the left in Step II?
- They are, in order: FILES (1), GRADE (2), PAIRS (3), FOREIGN (4), TOWARDS (5)
- So the third word is PAIRS
Let’s go over the options:
- Option 1, GRADE: that’s the second word.
- Option 2, PAIRS: third from the left.
- Option 3, FOREIGN: that’s fourth.
- Option 4, TOWARDS: that’s fifth.
- Option 5, None: nope.
Why?
- The “machine” kicks out anything starting with a vowel. What’s left: FILES, GRADE, PAIRS, FOREIGN, TOWARDS. Counting in order, PAIRS is the third. You nailed it.
By: Parvesh Mehta ProfileResourcesReport error
Access to prime resources
New Courses