How many different words can be formed by jumbling the letters in the word $MISSISSIPPI$ in which no two $S$ are adjacent?

  • A
    $8 \times ^6C_4$
  • B
    $6 \times 7 \times ^8C_4$
  • C
    $6 \times 8 \times ^7C_4$
  • D
    $7 \times ^6C_4 \times ^8C_4$

Explore More

Similar Questions

The number of permutations of the letters $a_1, a_2, a_3, a_4, a_5$ in which the first letter $a_1$ does not occupy the first position and the second letter $a_2$ does not occupy the second position is:

From a group of $7$ batsmen and $6$ bowlers,$10$ players are to be chosen for a team,which should include at least $4$ batsmen and at least $4$ bowlers. One batsman and one bowler,who are the captain and vice-captain of the team respectively,must be included. The total number of ways such a selection can be made is:

Let ${}^nC_{r-1}=28$,${}^nC_r=56$,and ${}^nC_{r+1}=70$. Let $A(4 \cos t, 4 \sin t)$,$B(2 \sin t, -2 \cos t)$,and $C(3r - n, r^2 - n - 1)$ be the vertices of a triangle $ABC$,where $t$ is a parameter. If $(3x - 1)^2 + (3y)^2 = \alpha$ is the locus of the centroid of triangle $ABC$,then $\alpha$ equals:

Let $S$ be the set of all seven-digit numbers that can be formed using the digits $0, 1$ and $2$. For example,$2210222$ is in $S$,but $0210222$ is not in $S$. Then the number of elements $x$ in $S$ such that at least one of the digits $0$ and $1$ appears exactly twice in $x$,is equal to $....$

If $n$ is an integer with $0 \leq n \leq 11$,then the minimum value of $n!(11-n)!$ is attained when a value of $n$ equals to

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