Night Class: Reasoning Quiz

Directions: Study the following information carefully and answer the questions given below:

A group of eight students A, B,C, D, E, F, G and H goes eight different cities viz Lucknow, Delhi, Kolkata, Bengaluru, Mumbai, Patna, Jaipur and Bhopal for participating in eight different activities Drama, Painting, Dialogue, Music, Acting, Discussion, Sports and Adventure, but not necessarily in the same order. D participates in discussion and neither go to Bengaluru nor to Mumbai. H goes to Kolkata. C goes to Patna and participates in Sports. One who participates in Painting goes to Bhopal. B participates in Music. One who goes to Jaipur, participate in Acting. H doesn't participate either in adventure or in dialogue. A does not go to Bengaluru and Bhopal. E, who goes to Lucknow doesn't like adventure. G goes to Mumbai.

1. Who is going to Delhi?

5) Other than given options

2. Who does participate in Drama?

5) Other than given options

3. One, who participates in Adventure is going to

1) Kolkata 

2) Delhi 

3) Lucknow 

4) Mumbai 

5) Other than given options

4. Which of the following combinations is true?

1) F – Jaipur – Acting 

2) G – Lucknow – Adventure 

3) B – Kolkata – Music

4) Other than given options 

5) E – Lucknow – Dialogue

5. Who is going to Bengaluru?

5) Other than given options

Directions: Study the following information carefully and answer the given questions.

When a word and number arrangement machine is given an input line of words and numbers, it arranges them following a particular rule. The following is an illustration of the input and rearrangement.

Input: variety 13 enough 7 12 maximum union 24 tree 4

Step I: enough variety 13 7 12 maximum union 24 tree 4

Step II: enough variety 13 12 maximum union 24 tree 4 7

Step III: enough maximum variety 13 12 union 24 tree 4 7

Step IV: enough maximum variety 13 union 24 tree 4 7 12

Step V: enough maximum union variety 13 24 tree 4 7 12

Step VI: enough maximum union variety 24 tree 4 7 12 13

Step VII: enough maximum union tree variety 24 4 7 12 13

Step VIII: enough maximum union tree variety 24 7 12 13 4

Step IX: enough maximum union tree variety 7 12 13 4 24

And step IX is the last step of the above arrangement. As per the rules followed in the above step, find out the appropriate step for the given input.

Input: steps 22 onion apt 19 tribe 4 new 18 13

6. How many steps will be required to complete the rearrangement of the above input?

2) Eight 

4) more than ten 

5) Both 3 and 4

7. Which step number is the following output?

apt new onion steps tribe 4 18 13 19 22

2) Step VI 

3) Step IX 

4) Step X 

5) Other than given options

8. How many elements are there between 'new' and '18' in step VI ?

9. Which of the following steps would be the last step but one?

1) Step VIII 

2) Step X 

3) Step IX 

4) Step VII 

5) Other than given options

10. What is the position of 'tribe' to the left of '13' in step VI?

1) Fifth 

2) Seventh 

3) Ninth 

4) Third 

5) Other than given options

11. Which of the following steps will be step VII?

1) apt new onion steps tribe 4 18 19 22 13

2) apt new onion steps tribe 4 19 22 13 18

3) apt new tribe steps onion 4 19 18 22 13

4) There is no any such step

5) Other than given options

This entry passed through the Full-Text RSS service - if this is your content and you're reading it on someone else's site, please read the FAQ at http://ift.tt/jcXqJW.