In an examination,there are $5$ multiple choice questions with $3$ choices each,out of which exactly one is correct. There are $3$ marks for each correct answer,$-2$ marks for each wrong answer,and $0$ marks if the question is not attempted. The number of ways a student appearing in the examination can get exactly $5$ marks is:

There are $4$ notes of Rs. $100$ and $5$ other notes of denominations Rs. $1$,Rs. $2$,Rs. $5$,Rs. $20$,and Rs. $50$. These $9$ notes are to be distributed among $3$ children such that each child receives at least one note of Rs. $100$. Find the total number of ways of distribution.

Consider all possible permutations of the letters of the word $ENDEANOEL$. Match the Statements / Expressions in $Column I$ with the Statements / Expressions in $Column II$.

$Column I$	$Column II$
$(A)$ The number of permutations containing the word $ENDEA$ is	$(p)$ $5!$
$(B)$ The number of permutations in which the letter $E$ occurs in the first and the last positions is	$(q)$ $2 \times 5!$
$(C)$ The number of permutations in which none of the letters $D, L, N$ occurs in the last five positions is	$(r)$ $7 \times 5!$
$(D)$ The number of permutations in which the letters $A, E, O$ occur only in odd positions is	$(s)$ $21 \times 5!$

There are $4$ men and $5$ women in Group $A$,and $5$ men and $4$ women in Group $B$. If $4$ persons are selected from each group,then the number of ways of selecting $4$ men and $4$ women is:

Let $S$ be the set of all passwords which are $6$ to $8$ characters long,where each character is either an alphabet from $\{A, B, C, D, E\}$ or a number from $\{1, 2, 3, 4, 5\}$ with the repetition of characters allowed. If the number of passwords in $S$ whose at least one character is a number from $\{1, 2, 3, 4, 5\}$ is $\alpha \times 5^{6}$,then $\alpha$ is equal to $.......$

The number of $4$-letter permutations formed using the English alphabet such that the number of distinct vowels is equal to the number of distinct consonants,when repetition is allowed,is