In how many ways can the letters of the word $ASSASSIN$ be arranged so that no two $S$s occur together?

Let $n$ be the number of ways in which $5$ boys and $5$ girls can stand in a queue such that all the girls stand consecutively. Let $m$ be the number of ways in which $5$ boys and $5$ girls can stand in a queue such that exactly four girls stand consecutively. Then the value of $\frac{m}{n}$ is

Out of $6$ distinct novels and $3$ distinct dictionaries,$4$ novels and $1$ dictionary are to be selected and arranged in a row on a shelf such that the dictionary is always in the middle. What is the number of such arrangements?

The number of $5$-digit numbers that can be formed using the digits $1, 2, 3, 4, 5, 6$ such that the number must include both $1$ and $2$ is:

$A$ question paper has $3$ parts $A, B, C$. Part $A$ contains $7$ questions,part $B$ contains $5$ questions,and part $C$ contains $3$ questions. If a candidate is allowed to answer not more than $4$ questions from part $A$,not more than $3$ questions from part $B$,and not more than $2$ questions from part $C$,then the number of ways in which a candidate can answer exactly $7$ questions is

The number of $4$ letter words (with or without meaning) that can be formed from the eleven letters of the word $'EXAMINATION'$ is