Number of different words that can be formed from all letters of the word $APPLICATION$ such that two vowels never come together is -

  • A
    $(45)7!$
  • B
    $8!$
  • C
    $6!7!$
  • D
    $(32)6!$

Explore More

Similar Questions

The value of ${2^n} \{ 1 \cdot 3 \cdot 5 \cdots (2n - 3) \cdot (2n - 1) \}$ is

Difficult
View Solution

The number of points,having both coordinates as integers,that lie in the interior of the triangle with vertices $(0,0)$,$(0,41)$,and $(41,0)$ is:

Difficult
View Solution

In a city,no two persons have an identical set of teeth,and there is no person without a tooth. Also,no person has more than $32$ teeth. If we disregard the shape and size of the teeth and consider only the presence or absence of a tooth at each of the $32$ positions,then the maximum population of the city is:

If the different permutations of the word $EXAMINATION$ are listed as in a dictionary,how many items are there in this list before the first word starting with $E?$

There are $6$ candidates for $3$ posts. In how many ways can the posts be filled?

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