1
GATE CSE 2008
+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
A
$${Q^c} \cup {R^c}$$
B
$$P \cup {Q^c} \cup {R^c}$$
C
$${P^c} \cup {Q^c} \cup {R^c}$$
D
$$U$$
2
GATE CSE 2007
+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
A
$$n$$ and $$n$$
B
$${n^2}\,$$ and $$n$$
C
$${n^2}\,$$ and $$0$$
D
$$n$$ and $$1$$
3
GATE CSE 2007
+1
-0.3
What is the maximum number of different Boolean functions involving $$n$$ Boolean variables?
A
$${n^2}\,$$
B
$${2^n}$$
C
$${2^{{2^n}}}$$
D
$${2^{{n^2}}}$$
4
GATE CSE 2006
+1
-0.3
Let $$X,. Y, Z$$ be sets of sizes $$x, y$$ and $$z$$ respectively. Let $$W = X x Y$$ and $$E$$ be the set of all subjects of $$W$$. The number of functions from $$Z$$ to $$E$$ is
A
$${2^{{2^{xy}}}}$$
B
$$2 \times {2^{xy}}$$
C
$${2^{{2^{x + y}}}}$$
D
$${2^{xyz}}$$
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization
EXAM MAP
Joint Entrance Examination