Difficulty distribution
How the classified questions are distributed by difficulty.
3questions
Easy
3
100%
Permutations, Combinations and Series - General Aptitude - General Aptitude (GA) Previous Year Questions
Practice Permutations, Combinations and Series - General Aptitude - General Aptitude (GA) previous year questions organised from real papers, with year-wise coverage and clear topic navigation.
2Papers
2Years
3Questions
1Topics
Permutations, Combinations and Series question pattern
Every graph below is calculated only from this selection.
Questions by year
Year-wise coverage for Permutations, Combinations and Series. Each bar uses a separate theme-derived color.
Question type distribution
MCQ, numerical, multiple-select and other formats found in these papers.
3questions
MCQ
3
100%
Subject weightage
Top subjects by unique question coverage.
Most asked topics
Top topics across the included previous year papers.
Subtopic coverage
Top subtopics inside this exact selection.
Paper coverage
Question coverage for the most populated papers. Every active PYP paper remains listed below.
Included previous year papers
Newest papers appear first. Sort by year, question coverage or name.
| Paper | Year / session | Questions in this view | Open |
|---|---|---|---|
| Life Sciences (XL) 2024 | 2024 | 1 | View paper |
| Life Sciences (XL) 2023 | 2023 | 2 | View paper |
All Permutations, Combinations and Series previous year questions
Practice every matching question in batches of 20, with every available option.
2023 · General Aptitude (GA) · General Aptitude · Permutations, Combinations and Series
Life Sciences (XL) 2023
A ‘frabjous’ number is defined as a 3 digit number with all digits odd, and no two adjacent digits being the same. For example, 137 is a frabjous number, while 133 is not. How many such frabjous numbers exist?
2023 · General Aptitude (GA) · General Aptitude · Permutations, Combinations and Series
Life Sciences (XL) 2023
Ankita has to climb 5 stairs starting at the ground, while respecting the following rules:
1. At any stage, Ankita can move either one or two stairs up.
2. At any stage, Ankita cannot move to a lower step.
Let \(F(N)\) denote the number of possible ways in which Ankita can reach the \(N^{th}\) stair. For example, \(F(1) = 1\), \(F(2) = 2\), \(F(3) = 3\).
The value of \(F(5)\) is ________.
1. At any stage, Ankita can move either one or two stairs up.
2. At any stage, Ankita cannot move to a lower step.
Let \(F(N)\) denote the number of possible ways in which Ankita can reach the \(N^{th}\) stair. For example, \(F(1) = 1\), \(F(2) = 2\), \(F(3) = 3\).
The value of \(F(5)\) is ________.
2024 · General Aptitude (GA) · General Aptitude · Permutations, Combinations and Series
Life Sciences (XL) 2024
Two wizards try to create a spell using all the four elements, water, air, fire, and earth. For this, they decide to mix all these elements in all possible orders. They also decide to work independently. After trying all possible combination of elements, they conclude that the spell does not work. How many attempts does each wizard make before coming to this conclusion, independently?