Quantitative Aptitude

General Questions

Quantitative Aptitude Exercise Mode

General Questions

Practice and master this topic with our carefully crafted questions.

10 Questions
15 Minutes
0% Completed
QUEST ? !
Question 11
In how many different ways can the letters of the word 'OPTICAL' be arranged so that the vowels always come together?

A
120
B
720
C
4320
D
2160
E
None of these
Correct Answer: Option B

The word 'OPTICAL' contains 7 different letters.

When the vowels OIA are always together, they can be supposed to form one letter.

Then, we have to arrange the letters PTCL (OIA).

Now, 5 letters can be arranged in 5! = 120 ways.

The vowels (OIA) can be arranged among themselves in 3! = 6 ways.

Required number of ways = (120 x 6) = 720.

Question 12
A box contains 2 white balls, 3 black balls and 4 red balls. In how many ways can 3 balls be drawn from the box, if at least one black ball is to be included in the draw?

A
32
B
48
C
64
D
96
E
None of these
Correct Answer: Option C

We may have(1 black and 2 non-black) or (2 black and 1 non-black) or (3 black).

Required number of ways

= (3C1 x 6C2) + (3C2 x 6C1) + (3C3)
= 3 x 6 x 5 + 3 x 2 x 6 + 1
2 x 1 2 x 1
= (45 + 18 + 1)
= 64.

Question 13
How many 3-digit numbers can be formed from the digits 2, 3, 5, 6, 7 and 9, which are divisible by 5 and none of the digits is repeated?

A
5
B
10
C
15
D
20
Correct Answer: Option D

Since each desired number is divisible by 5, so we must have 5 at the unit place. So, there is 1 way of doing it.

The tens place can now be filled by any of the remaining 5 digits (2, 3, 6, 7, 9). So, there are 5 ways of filling the tens place.

The hundreds place can now be filled by any of the remaining 4 digits. So, there are 4 ways of filling it.

Required number of numbers = (1 x 5 x 4) = 20.

Question 14
How many 4-letter words with or without meaning, can be formed out of the letters of the word, 'LOGARITHMS', if repetition of letters is not allowed?

A
40
B
400
C
5040
D
2520
Correct Answer: Option C

'LOGARITHMS' contains 10 different letters.

Required number of words = Number of arrangements of 10 letters, taking 4 at a time.

= 10P4
= (10 x 9 x 8 x 7)
= 5040.

Question 15
In how many different ways can the letters of the word 'MATHEMATICS' be arranged so that the vowels always come together?

A
10080
B
4989600
C
120960
D
None of these
Correct Answer: Option C

In the word 'MATHEMATICS', we treat the vowels AEAI as one letter.

Thus, we have MTHMTCS (AEAI).

Now, we have to arrange 8 letters, out of which M occurs twice, T occurs twice and the rest are different.

Number of ways of arranging these letters :

8! = 10080.
(2!)(2!)

Now, AEAI has 4 letters in which A occurs 2 times and the rest are different.

Number of ways of arranging these letters :

4! = 12.
2!

Required number of words = (10080 x 12) = 120960.

Question 16
How many different possible permutations can be made from the word ‘BULLET’ such that the vowels are never together?

A
360
B
120
C
480
D
240
Correct Answer: Option D

The word ‘BULLET’ contains 6 letters of which 1 letter occurs twice = 6! / 2! = 360

No. of permutations possible with vowels always together = 5! * 2! / 2! = 120

No. of permutations possible with vowels never together = 360-120 = 240.

Question 17
In how many ways can 22 books on English and 20 books on Hindi be placed in a row on a shelf so that two books on Hindi may not be together?

A
4586
B
5896
C
2415
D
1771
Correct Answer: Option D

In order that two books on Hindi are never together, we must place all these books as under:
H E H E H E H….. H E H

Where H denotes the position of Hindi book and E that of English book.

Since there are 22 books on English, the number of places marked E are 23.

Now, 20 places out of 23 can be chosen in 23C20

      = (23C3
= 23 x 22 x 21
3 x 2 x 1
= 1771.

Hence the number of ways = 1771 ways

Question 18
How many words can be formed by re-arranging the letters of the word ASCENT such that A and T occupy the first and last position respectively?

A
5!
B
4!
C
6! - 2!
D
6! / 2!
Correct Answer: Option B

As A and T should occupy the first and last position, the first and last position can be filled in only one way. The remaining 4 positions can be filled in 4! Ways by the remaining words (S,C,E,N,T).

Hence by rearranging the letters of the word ASCENT we can form 1x4! = 4! words.

Question 19
There are 2 brothers among a group of 20 persons. In how many ways can the group be arranged around a circle so that there is exactly one person between the two brothers?

A
2 × 17!
B
18! × 18
C
19! × 18
D
2 × 18!
E
2 × 17! × 17!
Correct Answer: Option D

Circular Permutation

'n' objects can be arranged around a circle in (n1)!

If arranging these 'n' objects clockwise or counter clockwise means one and the same, then the number arrangements will be half that number.

i.e., number of arrangements =  (n - 1)!
2

Let there be exactly one person between the two brothers as stated in the question.

If we consider the two brothers and the person in between the brothers as a block, then there will 17 others and this block of three people to be arranged around a circle.

The number of ways of arranging 18 objects around a circle is in 17! ways.

Now the brothers can be arranged on either side of the person who is in between the brothers in 2! ways.

The person who sits in between the two brothers could be any of the 18 in the group and can be selected in 18 ways.

Therefore, the total number of ways 18 × 17! × 2 = 2 × 18!

Question 20
A team of 8 students goes on an excursion, in two cars, of which one can seat 5 and the other only 4. In how many ways can they travel?

A
9
B
26
C
126
D
3920
Correct Answer: Option C

There are 8 students and the maximum capacity of the cars together is 9.

We may divide the 8 students as follows:

Case I: 5 students in the first car and 3 in the second

Case II: 4 students in the first car and 4 in the second

Hence, in Case I: 8 students are divided into groups of 5 and 3 in 8C3 ways.

Similarly, in Case II: 8 students are divided into two groups of 4 and 4 in 8C4 ways.

Therefore, the total number of ways in which 8 students can travel is:

(8C3 + 8C4) = 70 + 56 = 126