Home » Aptitude » Permutation and Combination

4 boys and 2 girls are to be seated in a row in such a way that two girls are always together. In how many different ways can they be seated?

Correct Answer: 240

Explanation:

Assume the 2 girl students to be together i,e (one). Now there are 5 students.
Possible ways of arranging them are 5! = 120
Now they (two girl) can arrange themselves in 2! ways.
Hence, total ways = 120 x 2! = 240

← Previous Question Next Question→

More Questions from Permutation and Combination

The total number of words, which can be formed out of the letters a, b, c, d, e, f taken 3 together, such that each word contains at least one vowel is?
A man has 5 friends and his wife has 4 friends. They want to invite either of their friends, one or more to a party. In how many ways can they do so?
If there are 10 positive real numbers n 1 < n 2, n 3 .... < n 10 How many triplets of these numbers (n 1, n 2, n 3) (n 2, n 3, n 4), ... can be generated such that in each triplet the first number is always less than the second number and the second number is always less the third number?
How many three letter computer passwords can be formed (no repetition allowed) with at least one symmetric letter?
A question paper had 10 questions. Each question could only be answered as True (T) or false (F). Each candidate answered all the questions. Yet, no two candidate wrote the answers in an identical sequence. How many different sequences of answers are possible?
Groups, each containing 3 boys are to be formed out of 5 boys, A, B , C, D and E such that no group can contain both C and D together. What is the maximum number of such different groups?
In a question paper, there are four multiple choice type question. Each question has five choices with only one choice for its correct answer. What is the total number of ways in which a candidate will not get all the four answers correct?
In how many difference ways can six players be arranged in a line such that two of them, Abhinav and Manjesh are never together?
A, B , C , and D are four towns, any three of which are non-collinear. Then, the number of ways to construct three roads each joining a pair of towns, so that the roads do not form a triangle, is?
Three dice (each having six faces with each face having one number from 1 or 6 ) are rolled. What is the number of possible outcomes such that atleast one dice shows the numbers 2?

Discussion & Comments

No comments yet. Be the first to comment!

Join Discussion