If all the letters of the word $ACADEMICIAN$ are permuted in all possible ways,then the number of permutations in which no two $A$'s are together and all the consonants are together is:

There are three sections in a question paper,each containing $4$ questions. If a candidate has to answer only $5$ questions from this paper without leaving any section,then the number of ways the candidate can make the choice of questions is:

If $n$ is the number of ways five different employees can sit into four indistinguishable offices where any office may have any number of persons including zero,then $n$ is equal to:

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?

In a group of $3$ girls and $4$ boys,there are two boys $B_1$ and $B_2$. The number of ways in which these girls and boys can stand in a queue such that all the girls stand together,all the boys stand together,but $B_1$ and $B_2$ are not adjacent to each other,is:

If $\alpha = ^mC_2$,then $^\alpha C_2$ is equal to