Discrete Mathematics
Set Theory & Algebra
Marks 1Marks 2Marks 5
Linear Algebra
Marks 1Marks 2
Combinatorics
Marks 1Marks 2
Mathematical Logic
Marks 1Marks 2Marks 5
Probability
Marks 1Marks 2
1
GATE CSE 2005
MCQ (Single Correct Answer)
+2
-0.6
Let R and S be any two equivalence relations on a non-emply set A. Which one of the following statements is TRUE?
A
$$R\, \cup \,S\,,\,R\, \cap \,S$$ are both equivalence relations
B
$$R\, \cup \,S\,$$ is an equivalence relations
C
$$R\, \cap \,S$$ is an equivalence relations
D
Neither $$R\, \cup \,S\,$$ nor $$R\, \cap \,S$$ is an equivalence relation
2
GATE CSE 2004
MCQ (Single Correct Answer)
+2
-0.6
The inclusion of which of the following sets into

S = { {1, 2}, 1, 2, 3}, {1, 3, 5}, {1, 2, 4},
{1, 2, 3, 4, 5} }
Is necessary and sufficient to make S a complete lattice under the partial order defined by set containment?

A
{1}
B
{1}, {2, 3}
C
{1}, {1, 3}
D
{1}, {1, 3}, {1, 2, 3, 4}, {1, 2, 3, 5}
3
GATE CSE 2004
MCQ (Single Correct Answer)
+2
-0.6
The following is the incomplete operation table of a 4-element group. GATE CSE 2004 Discrete Mathematics - Set Theory & Algebra Question 105 English The last row of the table is
A
$$\matrix{ c & a & e & b \cr } $$
B
$$\matrix{ c & b & a & e \cr } $$
C
$$\matrix{ c & b & e & a \cr } $$
D
$$\matrix{ c & e & a & b \cr } $$
4
GATE CSE 2002
MCQ (Single Correct Answer)
+2
-0.6
The binary relation $$S = \phi $$ (emply set) on set A = {1, 2, 3} is
A
Neither reflexive nor symmetric
B
Symmetric and reflexive
C
Transitive and reflexive
D
Transitive and symmetric
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