In a high school,a committee has to be formed from a group of $6$ boys $M_1, M_2, M_3, M_4, M_5, M_6$ and $5$ girls $G_1, G_2, G_3, G_4, G_5$.
$(i)$ Let $\alpha_1$ be the total number of ways in which the committee can be formed such that the committee has $5$ members,having exactly $3$ boys and $2$ girls.
$(ii)$ Let $\alpha_2$ be the total number of ways in which the committee can be formed such that the committee has at least $2$ members,and having an equal number of boys and girls.
$(iii)$ Let $\alpha_3$ be the total number of ways in which the committee can be formed such that the committee has $5$ members,at least $2$ of them being girls.
$(iv)$ Let $\alpha_4$ be the total number of ways in which the committee can be formed such that the committee has $4$ members,having at least $2$ girls and such that both $M_1$ and $G_1$ are $NOT$ in the committee together.
$LIST-I$$LIST-II$
$P$. The value of $\alpha_1$ is$1. 136$
$Q$. The value of $\alpha_2$ is$2. 189$
$R$. The value of $\alpha_3$ is$3. 192$
$S$. The value of $\alpha_4$ is$4. 200$
$5. 381$
$6. 461$

The correct option is:

  • A
    $P \rightarrow 4; Q \rightarrow 6; R \rightarrow 2; S \rightarrow 1$
  • B
    $P \rightarrow 1; Q \rightarrow 4; R \rightarrow 2; S \rightarrow 3$
  • C
    $P \rightarrow 4; Q \rightarrow 6; R \rightarrow 5; S \rightarrow 2$
  • D
    $P \rightarrow 4; Q \rightarrow 2; R \rightarrow 3; S \rightarrow 1$

Explore More

Similar Questions

The number of permutations of all the letters $AAAABBBC$ in which all the $A$'s appear together in a block of $4$ letters or all the $B$'s appear together in a block of $3$ letters,is-

Consider the following statements:
$(i)$ The number of one-one functions from set $A$ to set $B$,where $O(A) = m$ and $O(B) = n$ $(m \leq n)$,is given by ${}^n P_m$.
(ii) The number of ways in which $n$ people can be arranged at a circular table is $\frac{(n-1)!}{2}$.
(iii) The number of ways of selecting at least one thing out of the given $n$ distinct things is $2^n - 1$.
(iv) The number of ways in which $n$ distinguishable objects can be distributed into $k$ distinguishable bins is ${}^n C_{k-1}$.
Which of the following is true?

$^{37}C_4 + \sum_{r=1}^{5} {^{(42-r)}C_r} = $

The number of ways in which a committee of $7$ members can be formed from $6$ teachers,$5$ fathers,and $4$ students in such a way that at least one from each group is included and teachers form the majority among them,is

The total number of three-digit and five-digit integers which can be formed by using the digits $0, 1, 2, 3, 4, 5$,using each digit not more than once in each number,is:

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo