Question types

Permutations question types

188 questions across 6 question groups — pick any mix to generate a Maths paper with step-by-step answer keys.

188
Questions
6
Question groups
5
Question types
Sample Questions

Permutations questions

One sample from each question group in this chapter. Select any group above to see the full set with answer keys.

Q 1MCQ1 Mark
The number of ways in which the letters of the word $'\text{CONSTANT}'$ can be arranged without changing the relative positions of the vowels and consonants is.
  • $360$
  • B
    $256$
  • C
    $444$
  • D
    None of these.

Answer: A.

View full solution
Q 2MCQ1 Mark
If $^\text{k}+5\text{P}_\text{k+1}=\frac{11(\text{k}-3)}{2}.\ ^\text{k+3}\text{P}_\text{k},$ then the values of $k$ are :
  • A
    $7$ and $11$
  • $6$ and $7$
  • C
    $2$ and $11$
  • D
    $2$ and $6$

Answer: B.

View full solution
Q 3MCQ1 Mark
The number of five $-$ digit telephone numbers having at least one of their digits repeated is :
  • A
    $90000.$
  • B
    $100000.$
  • C
    $30240.$
  • $69760$

Answer: D.

View full solution
Q 4MCQ1 Mark
The number of ways in which the letters of the word $\text{ARTICLE}$ can be arranged so that even places are always occupied by consonants is:
  • $576$
  • B
    ${ }^4 C_3 \times 4$ !
  • C
    $2 \times 4!$
  • D
    None of these.

Answer: A.

View full solution
Q 5MCQ1 Mark
A $5-$ digit number divisible by $3$ is to be formed using the digits $0, 1, 2, 3, 4$ and $5$ without repetition. The total number of ways in which this can be done is :
  • $216$
  • B
    $600$
  • C
    $240$
  • D
    $3125$

Answer: A.

View full solution
A number lock on a suitcase has 3 wheels each labelled with ten digits 0 to 9. If opening of the lock is a particular sequence of three digits with no repeats, how many such sequences will be possible? Also, find the number of unsuccessful attempts to open the lock.
View full solution
How many words (with or without dictionary meaning) can be made from the letters in the word MONDAY, assuming that no letter is repeated, if
  1. 4 letters are used at a time?
  2. All letters are used at a time.
  3. All letters are used but first is vowel.
View full solution

Generate a Permutations paper free

Pick question groups from the list above, set marks and difficulty, and export a branded PDF with step-by-step answer keys. First 3 chapters free — no signup.

Download App