Your cart is empty.
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.
Every graph below is calculated only from this selection.
Year-wise coverage for Permutations, Combinations and Series. Each bar uses a separate theme-derived color.
How the classified questions are distributed by difficulty.
MCQ, numerical, multiple-select and other formats found in these papers.
Top subjects by unique question coverage.
Top topics across the included previous year papers.
Top subtopics inside this exact selection.
Question coverage for the most populated papers. Every active PYP paper remains listed below.
Newest papers appear first. Sort by year, question coverage or name.
| Paper | Year / session | Questions in this view | Open |
|---|---|---|---|
| Computer Science & Information Technology (CS) 2025 [Session 1] | 2025 | 1 | View paper |
| Computer Science & Information Technology (CS) 2024 [Session 2] | 2024 | 1 | View paper |
| Computer Science & Information Technology (CS) 2016 [Session 2] | 2016 | 1 | View paper |
| Computer Science & Information Technology (CS) 2015 [Session 1] | 2015 | 1 | View paper |
| Computer Science & Information Technology (CS) 2015 [Session 2] | 2015 | 2 | View paper |
| Computer Science & Information Technology (CS) 2015 [Session 3] | 2015 | 1 | View paper |
| Computer Science & Information Technology (CS) 2012 | 2012 | 1 | View paper |
Practice every matching question in batches of 20, with every available option.
Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal to
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?
A shop has 4 distinct flavors of ice-cream. One can purchase any number of scoops of any flavor. The order in which the scoops are purchased is inconsequential. If one wants to purchase 3 scoops of ice-cream, in how many ways can one make that purchase?