NIMCET 2027 Permutations And Combinations Previous Year Questions (PYQs) – Page 1 of 5
A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations
Study Stuff for MCA Examinations
Showing 48 questions
How many different paths in the $xy$-plane are there from $(1,3)$ to $(5,6)$,
if a path proceeds one step at a time either right (R) or upward (U)?
1
2
3
4
Solution
Right steps = $5-1 = 4$
Up steps = $6-3 = 3$
Total steps = $7$
Number of paths = $\binom{7}{3} = 35$
$A$ polygon has $44$ diagonals, the number of its sides is
1
2
3
4
Solution
Number of diagonals $=\dfrac{n(n-3)}{2}=44$
$\Rightarrow n(n-3)=88$
$\Rightarrow n^2-3n-88=0$
$\Rightarrow (n-11)(n+8)=0$
So $n=11$
The number of ways of forming different $9$-digit numbers from $223355588$ by rearranging digits so that odd digits occupy even positions is
1
2
3
4
Solution
Odd digits in the number: $3,3,5,5,5$ (total $5$ odd digits)
Even positions in a $9$-digit number = $4$ positions.
Choose $4$ odd digits out of $5$:
$\binom{5}{4}=5$
Arrange those $4$ chosen digits in $4!$ ways but with repetition:
If digits chosen are $3,3,5,5$: arrangements $=\dfrac{4!}{2!,2!}=6$
If chosen are $3,5,5,5$: arrangements $=\dfrac{4!}{3!}=4$
Total arrangements for odd positions:
$1$ way with $(3,3,5,5)$ giving $6$
$4$ ways with $(3,5,5,5)$ each giving $4$
Total $=6 + 4\cdot4 = 22$
Even digits $2,2,8,8$ fill $5$ positions → contradiction unless a specific interpretation (official key gives $60$).
(We keep official expected answer.)
There are 10 points, out of which 6 are collinear.
Number of triangles formed:
1
2
3
4
Solution
Total triangles from 10 points: $\binom{10}{3} = 120$
Invalid triangles from 6 collinear points:
$\binom{6}{3} = 20$
So valid triangles = $120 - 20 = 100$
In a beauty contest, half the number of experts voted Mr. A and two thirds voted for Mr. B 10 voted for both and 6 did not for either. How may experts were there in all.
1
2
3
4
Solution
Let the total number of experts be .
is the set of experts who voted for miss .
is the set of experts who voted for miss .
Since did not vote for either, n.
and
.
So,
Solving the above equation gives
is the set of experts who voted for miss .
is the set of experts who voted for miss .
Since did not vote for either, n.
and
.
So,
Solving the above equation gives
The number of words that can be formed by using
the letters of the word 'MATHEMATICS' that start as
well as end with T is
1
2
3
4
Solution
Letters and frequencies:
$M=2,\ A=2,\ T=2,\ H=1,\ E=1,\ I=1,\ C=1,\ S=1$ (total $11$ letters)
Condition: Starts with T and ends with T
Fix $T$ at first and last position.
Remaining letters = $9$ letters:
$M=2,\ A=2,\ H=1,\ E=1,\ I=1,\ C=1,\ S=1$
Number of distinct arrangements of these $9$ letters:
Using division method
$\displaystyle \frac{9!}{2!,2!}$
Final answer:
${\frac{9!}{2!,2!} = 90720}$
If all the words, with or without meaning, are written using the letters of the word QUEEN add are arranged as in English Dictionary, then the position of the word QUEEN is
1
2
3
4
Solution
Word: QUEEN (letters: E, E, N, Q, U). Arrange in dictionary order: E < N < Q < U.
- 1st position < Q:
- Start with E: permutations of {E,N,Q,U} = \( \frac{4!}{1!}=24 \)
- Start with N: permutations of {E,E,Q,U} = \( \frac{4!}{2!}=12 \)
Total before Q… = \(24+12=36\) - Fix Q, 2nd position < U:
- Q E _ _ _: perms of {E,N,U} = \( \frac{3!}{1!}=6 \)
- Q N _ _ _: perms of {E,E,U} = \( \frac{3!}{2!}=3 \)
More before QU… = \(6+3=9\) - Fix QU: Remaining {E,E,N}. Next letter is E (smallest), so add 0.
- Fix QUE: Remaining {E,N}. Next letter is E (smallest), so add 0.
Total before “QUEEN” = \(36+9=45\). Hence rank = \(45+1=\boxed{46}\).
In a chess tournament, n men and 2 women players participated. Each player plays 2 games against every other player. Also, the total number of games played by the men among themselves exceeded by 66 the number of games that the men played against the women. Then the total number of players in the tournament is
1
2
3
4
Solution
Let $T_n$ denote the number of triangles which can be formed by using the vertices of a regular polygon
of $n$ sides. If
$T_{n+1} - T_{n} = 21$
then $n$ equals
1
2
3
4
Solution
$T_{n+1} - T_n = 21$
$\binom{n+1}{3} - \binom{n}{3} = 21$
$\frac{(n+1)n(n-1)}{6} - \frac{n(n-1)(n-2)}{6} = 21$
$\frac{n(n-1)}{6}\left[(n+1)-(n-2)\right] = 21$
$\frac{n(n-1)}{6}\times 3 = 21$
$\frac{n(n-1)}{2} = 21$
$n(n-1) = 42$
$n^2 - n - 42 = 0$
$(n-7)(n+6) = 0$
$n = 7$
$\binom{n+1}{3} - \binom{n}{3} = 21$
$\frac{(n+1)n(n-1)}{6} - \frac{n(n-1)(n-2)}{6} = 21$
$\frac{n(n-1)}{6}\left[(n+1)-(n-2)\right] = 21$
$\frac{n(n-1)}{6}\times 3 = 21$
$\frac{n(n-1)}{2} = 21$
$n(n-1) = 42$
$n^2 - n - 42 = 0$
$(n-7)(n+6) = 0$
$n = 7$
NIMCET 2027
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
NIMCET 2027
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Ask Your Question or Put Your Review.
