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 2025 Set 1
MCQ (More than One Correct Answer)
+2
-0

$A=\{0,1,2,3, \ldots\}$ is the set of non-negative integers. Let $F$ be the set of functions from $A$ to itself. For any two functions, $f_1, f_2 \in \mathrm{~F}$ we define

$$\left(f_1 \odot f_2\right)(n)=f_1(n)+f_2(n)$$

for every number $n$ in $A$. Which of the following is/are CORRECT about the mathematical structure $(\mathrm{F}, \odot)$ ?

A
$(F, \odot)$ is an Abelian group.
B
$(F, \odot)$ is an Abelian monoid.
C
$(F, \odot)$ is a non-Abelian group.
D
$(F, \odot)$ is a non-Abelian monoid.
2
GATE CSE 2024 Set 2
Numerical
+2
-0

Let Zn be the group of integers {0, 1, 2, ..., n − 1} with addition modulo n as the group operation. The number of elements in the group Z2 × Z3 × Z4 that are their own inverses is __________.

Your input ____
3
GATE CSE 2024 Set 1
MCQ (More than One Correct Answer)
+2
-0
Consider the operators $\diamond$ and $\square$ defined by $a \diamond b=a+2 b, a \square b=a b$, for positive integers. Which of the following statements is/are TRUE?
A
Operator $\diamond$ obeys the associative law
B
Operator $\square$ obeys the associative law
C
Operator $\diamond$ over the operator $\square$ obeys the distributive law
D
Operator $\square$ over the operator $\diamond$ obeys the distributive law
4
GATE CSE 2023
MCQ (More than One Correct Answer)
+2
-0

Let $$f:A \to B$$ be an onto (or surjective) function, where A and B are nonempty sets. Define an equivalence relation $$\sim$$ on the set A as

$${a_1} \sim {a_2}$$ if $$f({a_1}) = f({a_2})$$,

where $${a_1},{a_2} \in A$$. Let $$\varepsilon = \{ [x]:x \in A\} $$ be the set of all the equivalence classes under $$\sim$$. Define a new mapping $$F:\varepsilon \to B$$ as

$$F([x]) = f(x)$$, for all the equivalence classes $$[x]$$ in $$\varepsilon $$.

Which of the following statements is/are TRUE?

A
F is NOT well-defined.
B
F is an onto (or surjective) function.
C
F is a one-to-one (or injective) function.
D
F is a bijective function.
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