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

The value of $(2 \cdot {}^{1}P_{0} - 3 \cdot {}^{2}P_{1} + 4 \cdot {}^{3}P_{2} - \dots \text{ up to } 51^{\text{th}} \text{ term}) + (1! - 2! + 3! - \dots \text{ up to } 51^{\text{th}} \text{ term})$ is equal to

If four letters are chosen from the letters of the word $ASSIGNMENT$ and are arranged in all possible ways to form $4$-letter words (with or without meaning),then the total number of such words that can be formed is:

$A$ person forgets his $4-$digit $ATM$ pin code. But he remembers that in the code all the digits are different,the greatest digit is $7$ and the sum of the first two digits is equal to the sum of the last two digits. Then the maximum number of trials necessary to obtain the correct code is $...........$.

Out of all possible $8$-digit numbers formed using all the digits $0, 0, 1, 1, 2, 3, 4, 4$,a number is randomly selected. The probability that the selected number is odd 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?