1
GATE CSE 2008
MCQ (Single Correct Answer)
+1
-0.3
If $$P, Q, R$$ are subsets of the universal set $$U$$, then
$$\left( {P \cap Q \cap R} \right) \cup \left( {{P^c} \cap Q \cap R} \right) \cup {Q^c} \cup {R^c}$$ is
$$\left( {P \cap Q \cap R} \right) \cup \left( {{P^c} \cap Q \cap R} \right) \cup {Q^c} \cup {R^c}$$ is
2
GATE CSE 2007
MCQ (Single Correct Answer)
+1
-0.3
Let $$S$$ be a set6 of $$n$$ elements. The number of ordered pairs in the largest and the smallest equivalence relations on $$S$$ are
3
GATE CSE 2007
MCQ (Single Correct Answer)
+1
-0.3
What is the maximum number of different Boolean functions involving $$n$$ Boolean variables?
4
GATE CSE 2006
MCQ (Single Correct Answer)
+1
-0.3
A relation $$R$$ is defined on ordered pairs of integers as follows:
$$\left( {x,y} \right)R\left( {u,v} \right)\,if\,x < u$$ and $$y > v$$. Then $$R$$ is
Questions Asked from Set Theory & Algebra (Marks 1)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE 2024 Set 2 (1)
GATE CSE 2024 Set 1 (1)
GATE CSE 2021 Set 2 (1)
GATE CSE 2020 (2)
GATE CSE 2019 (2)
GATE CSE 2015 Set 1 (1)
GATE CSE 2015 Set 3 (1)
GATE CSE 2015 Set 2 (2)
GATE CSE 2014 Set 3 (1)
GATE CSE 2013 (2)
GATE CSE 2010 (2)
GATE CSE 2009 (2)
GATE CSE 2008 (1)
GATE CSE 2007 (2)
GATE CSE 2006 (4)
GATE CSE 2005 (4)
GATE CSE 2004 (3)
GATE CSE 2001 (1)
GATE CSE 1999 (1)
GATE CSE 1998 (3)
GATE CSE 1997 (1)
GATE CSE 1996 (4)
GATE CSE 1995 (2)
GATE CSE 1993 (2)
GATE CSE 1987 (2)
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages