Web Page

Syllabus: Sets, Relations, Functions, Partial orders, Lattices, Monoids, Groups.

$$\scriptsize{\overset{{\large{\textbf{Mark Distribution in Previous GATE}}}}{\begin{array}{|c|c|c|c|c|c|c|c|}\hline
\textbf{Year}&\textbf{2024-1} &\textbf{2024-2} &\textbf{2023} & \textbf{2022} & \textbf{2021-1}&\textbf{2021-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} &1&1&0& 1&0&1&0&0.83&1
\\\hline\textbf{2 Marks Count} &1&1&2& 0 &2&1&0&1.16&2
\\\hline\textbf{Total Marks} & 3&3&4&1&4&3&\bf{1}&\bf{3}&\bf{4}\\\hline
\end{array}}}$$

Previous GATE Questions in Set Theory & Algebra

24 votes
5 answers
62
Let $X = \{2, 3, 6, 12, 24\}$, Let $\leq$ be the partial order defined by $X \leq Y$ if $x$ divides $y$. Number of edges in the Hasse diagram of $(X, \leq)$ is$3$$4$$9$No...
27 votes
8 answers
63
Let $A$ and $B$ be sets and let $A^c$ and $B^c$ denote the complements of the sets $A$ and $B$. The set $(A-B) \cup (B-A) \cup (A \cap B)$ is equal to$A \cup B$$A^c \cup ...
27 votes
5 answers
65
Let $G_1$ and $G_2$ be subgroups of a group $G$.Show that $G_1 \cap G_2$ is also a subgroup of $G$.Is $G_1 \cup G_2$ always a subgroup of $G$?.
24 votes
6 answers
68
The number of elements in the power set $P(S)$ of the set $S=\{\{\emptyset\}, 1, \{2, 3\}\}$ is:$2$$4$$8$None of the above
31 votes
6 answers
69
3 votes
0 answers
70
21 votes
5 answers
71
18 votes
4 answers
72
The Hasse diagrams of all the lattices with up to four elements are ________ (write all the relevant Hasse diagrams)
31 votes
4 answers
73
25 votes
3 answers
74
Amongst the properties $\left\{\text{reflexivity, symmetry, anti-symmetry, transitivity}\right\}$ the relation $R=\{(x, y) \in N^2|x \neq y\}$ satisfies _________
39 votes
4 answers
75
43 votes
3 answers
76
32 votes
4 answers
77
43 votes
4 answers
78
Out of a group of $21$ persons, $9$ eat vegetables, $10$ eat fish and $7$ eat eggs. $5$ persons eat all three. How many persons eat at least two out of the three dishes?
29 votes
3 answers
79
Let $A$ and $B$ be sets with cardinalities $m$ and $n$ respectively. The number of one-one mappings from $A$ to $B$, when $m < n$, is$m^n$$^nP_m$$^mC_n$$^nC_m$$^mP_n$