Set Theory & Algebra · Discrete Mathematics · GATE CSE
Marks 1
Let $P$ be the partial order defined on the set {1,2,3,4} as follows:
$P = \{(x, x) \mid x \in \{1,2,3,4\}\} \cup \{(1,2), (3,2), (3,4)\}$
The number of total orders on {1,2,3,4} that contain $P$ is _________.
Let $A$ and $B$ be non-empty finite sets such that there exist one-to-one and onto functions (i) from $A$ to $B$ and (ii) from $A \times A$ to $A \cup B$. The number of possible values of $|A|$ is _______
Consider the following sets, where n > 2:
S1: Set of all n x n matrices with entries from the set {a, b, c}
S2: Set of all functions from the set {0,1, 2, ..., n2 — 1} to the set {0, 1, 2}
Which of the following choice(s) is/are correct?
R1: ∀a,b ∈ G, aR1b if and only if ∃g ∈ G such that a = g-1bg
R2: ∀a,b ∈ G, aR2b if and only if a = b-1
Which of the above is/are equivalence relation/relations?
I. |A| = n2n–1
II. |A| = $$\sum\limits_{k = 1}^n {k\left( {\matrix{ n \cr k \cr } } \right)} $$
Which of the above statements is/are TRUE?
I. $$\phi \in {2^A}$$
II. $$\phi \subseteq {2^A}$$
III. $$\left\{ {5,\left\{ 6 \right\}} \right\} \in {2^A}$$
IV. $$\left\{ {5,\left\{ 6 \right\}} \right\} \subseteq {2^A}$$
$$\left( {P \cap Q \cap R} \right) \cup \left( {{P^c} \cap Q \cap R} \right) \cup {Q^c} \cup {R^c}$$ is
Which one of them is false?
$${\rm I}$$) $$\,\,\,\,\,\,f\left( {x,y} \right) = x + y - 3$$
$${\rm I}{\rm I}$$ $$\,\,\,\,\,\,f\left( {x,y} \right) = {\mkern 1mu} \max \left( {x,y} \right)$$
$${\rm I}{\rm I}{\rm I}$$$$\,\,\,\,\,f\left( {x,y} \right) = \,{x^y}$$
The poset is:
Which one of the following is TRUE?
The reflexive transitive closure of $$S$$ is
i) An element $$x$$ in $$A$$ is related to an element $$y$$ in $$B$$ (under $${R_1}$$) if $$ x + y $$ is divisible by $$3$$.
ii) An element EExEE in $$B$$ is related to an elements $$y$$ in $$C$$ (under $${R_2}$$) if $$x + y$$ is even but not divisible by $$3$$.
Which is the composite relation $$R1R2$$ from $$A$$ to $$C$$?
$${R_1}\,\,\left( {a,\,\,b} \right)\,\,\,iff\,\,\left( {a + b} \right)$$ is even over the set of integers
$${R_2}\,\,\left( {a,\,\,b} \right)\,\,\,iff\,\,\left( {a + b} \right)$$ is odd over the set of integers
$${R_3}\,\,\left( {a,\,\,b} \right)\,\,\,iff\,\,a.b > 0$$ over the set of non-zero rational numbers
$${R_4}\,\,\left( {a,\,\,b} \right)\,\,\,iff\,\,\left| {a - b} \right| \le 2$$ over the set of natural numbers
Which of the following statements is correct?
(i)$$\,\,\,\,{R_1} \cup {R_2}$$ is an euivalence relation
(ii)$$\,\,\,\,{R_1} \cap {R_2}$$ is an equivalence relation
Which of the following is correct?
(b) How many one - to - one functions are there from a set A with n elements onto itself
(a) The union of two equivalence relations is also an equivalence relation.
Marks 2
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 __________.
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?
Let X be a set and 2$$^X$$ denote the powerset of X. Define a binary operation $$\Delta$$ on 2$$^X$$ as follows:
$$A\Delta B=(A-B)\cup(B-A)$$.
Let $$H=(2^X,\Delta)$$. Which of the following statements about H is/are correct?
$$\,\,\,\,\,\,\,\,$$ $$P:$$ Set of Rational numbers (positive and negative)
$$\,\,\,\,\,\,\,\,$$ $$Q:$$ Set of functions from $$\left\{ {0,1} \right\}$$ to $$N$$
$$\,\,\,\,\,\,\,\,$$ $$R:$$ Set of functions from $$N$$ to $$\left\{ {0,1} \right\}$$
$$\,\,\,\,\,\,\,\,$$ $$S:$$ Set of finite subsets of $$N.$$
Which of the sets above are countable?
Let $$R = \left\{ i \right.|\exists j:f\left( j \right) = \left. i \right\}$$ be the set of distinct values that $$f$$ takes. The maximum possible size of $$R$$ is _____________________.
$$P:$$ $$R$$ is reflexive
$$Q:$$ $$R$$ is transitive
Which one of the following statements is TRUE?
$$\,\,\,\,\,\,\,{\rm I}.\,\,\,\,\,$$ Each compound in $$U \ S$$ reacts with an odd number of compounds.
$$\,\,\,\,\,{\rm I}{\rm I}.\,\,\,\,\,$$ At least one compound in $$U \ S$$ reacts with an odd number of compounds.
$$\,\,\,{\rm I}{\rm I}{\rm I}.\,\,\,\,\,$$ Each compound in $$U \ S$$ reacts with an even number of compounds.
Which one of the above statements is ALWAYS TRUE?
$$P$$. For each such function it must be the case that for every $$i$$, $$f\left( i \right) = i$$
$$Q$$. For each such function it must be the case that for some $$i$$, $$f\left( i \right) = 1$$
$$R$$. Each such function must be onto.
Which one of the following id CORRECT?
$$x * x = y * y = x * y * x * y = y * x * y * x = e$$
where $$e$$ is the identity element. The maximum number of elements in such a group is ______.
Consider the following two statements:
S1 There is a subset of S that is larger than every other subset.
Which one of the following is CORRECT?
Which one of the following choices is correct?
Which all of the above represent a lattice?
i) (0, 0) $$ \in \,P$$.
ii) (a, b) $$ \in \,P$$ if and only a %
$$10\, \le $$ b % 10 and
)a/10, b/10) $$ \in \,P$$.
Consider the following ordered pairs:
$$\matrix{
{i)\,\,\,(101,\,22)} & {ii)\,\,\,(22,\,\,101)} \cr
{iii)\,\,\,(145,\,\,265)} & {iv)\,\,\,(0,\,153)} \cr
} $$
Which of these ordered pairs of natural numbers are comtained in P?
Then $$\sum\limits_{i - 1}^m {f\,(i)} $$ is
Let $$X = \,\left( {E\, \cap \,F\,} \right)\, - \,\left( {F\, \cap \,G\,} \right)$$
and $$Y = \,\left( {E\, - \left( {E\, \cap \,G} \right)} \right)\, - \,\left( {E\, - \,F\,} \right)$$. Which one of the following is true?
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?

S1: There exist infinite sets A, B, C such that
$$A\, \cap \left( {B\, \cup \,C} \right)$$ is finite.
S2: There exist two irrational numbers x and y such that (x + y) is rational.
Which of the following is true about S1 and S2?
$$S1:\,f\,\left( {E\, \cup \,F} \right)\, = \,f\left( E \right)\, \cup \,f\,\left( F \right)$$
$$S2:\,f\,\left( {E\, \cap \,F} \right)\, = \,f\left( E \right)\, \cap \,f\,\left( F \right)$$
Which of the following is true about S1 and S2?
(a) Mr. X claims the following:
If a relation R is both symmetric and transitive, then R is reflexive. For this, Mr. X offers the following proof.
"From xRy, using symmetry we get yRx. Now because R is transitive, xRy and yRx togethrer imply xRx. Therefore, R is reflextive."
Briefly point out the flaw in Mr. X' proof.
(b) Give an example of a relation R which is symmetric and transitive but not reflexive.
(a) Show that for every a in A
a * a = a
(b) Show that for every a, b in A
a * b * a = a
(c) Show that for every a, b, c in A
a * b * c = a * c
$${\Pi _1}\, = \,\{ \{ a,\,\,b,\,\,c\,\} \,,\,\{ d\} \,\} $$
(a) List the ordered pairs of the equivalence relations induced by $${\Pi _1}$$
(b) Draw the graph of the above equivalence relation.
$$\left\{ {\left( {1,2} \right)\left( {2,3} \right)\left( {3,4} \right)\left( {5,4} \right)} \right\}$$
on the set $$A = \left\{ {1,2,3,4,5} \right\}$$ is ________ .
Marks 5
(a) Give the expression for $${N_r}$$ in terms of $$n$$.
(b) Give the expression for $${N_f}$$ in terms of $$n$$.
(c) Which is larger for all possible $$n, $$ $${N_r}$$ or $${N_f}$$?
Add the minimumnumber of ordered pairs to $$S$$ to make it an $$\,\,\,\,\,$$equivalence relation. Give the modified $$S$$.
(b) Let $$S = \left\{ {a,\,\,b} \right\}\,\,\,\,$$ and let ▢ $$S$$ be the power set of $$S$$. Consider the binary relation $$'\underline \subset $$ (set inclusion)' on ▢ $$S$$. Draw the Hasse diagram corresponding to the lattice (▢$$(S)$$, $$\underline \subset $$)
(a) what is the number of multisets of size 4 that can be constructed from n distinct elements so that at least one element occurs exactly twice?
(b) How many multisets can be constructed from n distinct elements?
(a) Prove that $$\left( {0,\,1,\, \otimes } \right)$$ is not a group.
(b) Write $$3$$ distinct groups $$\left( {G,\,\, \otimes } \right)$$ where $$G \subset s$$ and $$G$$ has $$2$$ $$\,\,\,\,\,\,$$elements.
(a) Show that $${G_1}\, \cap \,{G_2}$$ is also a subgroup of $$G$$.
(b) $${\rm I}$$s $${G_1}\, \cup \,{G_2}$$ always a subgroup of $$G$$?
show that there exists an element $$a \ne e$$,
the identifier $$g$$, such that
$${a^2} = e$$
(b) Consider the set of integers $$\left\{ {1,2,3,4,6,8,12,24} \right\}$$ together with the two binary operations LCM (lowest common multiple) and GCD (greatest common divisor). Which of the following algebraic structures does this represent?
i) Group ii) ring
iii) field iv) lattice
Justify your answer