My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Previous year question hub

Set Theory - General Aptitude - General Aptitude (GA) Previous Year Questions

Practice Set Theory - General Aptitude - General Aptitude (GA) previous year questions organised from real papers, with year-wise coverage and clear topic navigation.

6Papers
4Years
8Questions
1Topics

Set Theory question pattern

Every graph below is calculated only from this selection.

Questions by year

Year-wise coverage for Set Theory. Each bar uses a separate theme-derived color.

Difficulty distribution

How the classified questions are distributed by difficulty.

Medium 4 50%
Easy 3 37.5%
Hard 1 12.5%

Question type distribution

MCQ, numerical, multiple-select and other formats found in these papers.

MCQ 7 87.5%
Numerical Answer Type (NAT) 1 12.5%

Subject weightage

Top subjects by unique question coverage.

General Aptitude (GA)
8 Qs

Most asked topics

Top topics across the included previous year papers.

General Aptitude
8 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Set Theory
8 Qs

Paper coverage

Question coverage for the most populated papers. Every active PYP paper remains listed below.

Computer Science & Information Technology (CS) 2024 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2019 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2015 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2015 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2015 [Session 3]
1 Qs
Computer Science & Information Technology (CS) 2012
2 Qs

Included previous year papers

Newest papers appear first. Sort by year, question coverage or name.

PaperYear / sessionQuestions in this viewOpen
Computer Science & Information Technology (CS) 2024 [Session 2]20241View paper
Computer Science & Information Technology (CS) 2019 [Session 2]20191View paper
Computer Science & Information Technology (CS) 2015 [Session 1]20151View paper
Computer Science & Information Technology (CS) 2015 [Session 2]20152View paper
Computer Science & Information Technology (CS) 2015 [Session 3]20151View paper
Computer Science & Information Technology (CS) 201220122View paper

All Set Theory previous year questions

Practice every matching question in batches of 20, with every available option.

1
2012 · General Aptitude (GA) · General Aptitude · Set Theory
Computer Science & Information Technology (CS) 2012
Given the language \(L = \{ab, aa, baa\}\), which of the following strings are in \(L^*\)?
1) \(abaabaaabaa\)
2) \(aaaabaaaa\)
3) \(baaaaabaaaab\)
4) \(baaaaabaa\)
Open complete paper
2
2012 · General Aptitude (GA) · General Aptitude · Set Theory
Computer Science & Information Technology (CS) 2012

How many onto (or surjective) functions are there from an n-element (n ≥ 2) set to a 2-element set?

Open complete paper
3
2015 · General Aptitude (GA) · General Aptitude · Set Theory
Computer Science & Information Technology (CS) 2015 [Session 1]
For a set \( A \), the power set of \( A \) is denoted by \( 2^A \). If \( A = \{5, \{6\}, \{7\}\} \), which of the following options are TRUE? I. \( \emptyset \in 2^A \) II. \( \emptyset \subseteq 2^A \) III. \( \{5, \{6\}\} \in 2^A \) IV. \( \{5, \{6\}\} \subseteq 2^A \)
Open complete paper
4
2015 · General Aptitude (GA) · General Aptitude · Set Theory
Computer Science & Information Technology (CS) 2015 [Session 2]
The cardinality of the power set of { 0, 1, 2, ..., 10 } is ______.
Open complete paper
5
2015 · General Aptitude (GA) · General Aptitude · Set Theory
Computer Science & Information Technology (CS) 2015 [Session 2]
Consider two relations R1(A,B) with the tuples (1,5), (3,7) and R2(A,C) = (1,7), (4,9). Assume that R(A,B,C) is the full natural outer join of R1 and R2. Consider the following tuples of the form (A,B,C): a = (1,5,null), b = (1,null,7), c = (3, null, 9), d = (4,7,null), e = (1,5,7), f = (3,7,null), g = (4,null,9). Which one of the following statements is correct?
Open complete paper
6
2015 · General Aptitude (GA) · General Aptitude · Set Theory
Computer Science & Information Technology (CS) 2015 [Session 3]
Suppose U is the power set of the set S = {1,2,3,4,5,6}. For any T ∈ U, let |T| denote the number of elements in T and T' denote the complement of T. For any T, R ∈ U, let T \ R be the set of all elements in T which are not in R. Which one of the following is true?
Open complete paper
7
2019 · General Aptitude (GA) · General Aptitude · Set Theory
Computer Science & Information Technology (CS) 2019 [Session 2]
In a college, there are three student clubs. Sixty students are only in the Drama club, 80 students are only in the Dance club, 30 students are only in the Maths club, 40 students are in both Drama and Dance clubs, 12 students are in both Dance and Maths clubs, 7 students are in both Drama and Maths clubs, and 2 students are in all the clubs. If 75% of the students in the college are not in any of these clubs, then the total number of students in the college is ____.
Open complete paper
8
2024 · General Aptitude (GA) · General Aptitude · Set Theory
Computer Science & Information Technology (CS) 2024 [Session 2]
In an engineering college of 10,000 students, 1,500 like neither their core branches nor other branches. The number of students who like their core branches is 1/4th of the number of students who like other branches. The number of students who like both their core and other branches is 500. The number of students who like their core branches is
Open complete paper