Register
Filter

Previous GATE Questions in Discrete Mathematics

23 votes
3 answers
222
GATE CSE 1998 | Question: 1.23
How many sub strings of different lengths (non-zero) can be formed from a character string of length $n$? $n$ $n^2$ $2^n$ $\frac{n(n+1)}{2}$
How many sub strings of different lengths (non-zero) can be formed from a character string of length $n$?$n$$n^2$$2^n$$\frac{n(n+1)}{2}$
User Avatar
20 votes
4 answers
223
GATE CSE 1998 | Question: 1.8
The number of functions from an $m$ element set to an $n$ element set is $m + n$ $m^n$ $n^m$ $m*n$
The number of functions from an $m$ element set to an $n$ element set is$m + n$$m^n$$n^m$$m*n$
User Avatar
19 votes
5 answers
225
GATE CSE 1998 | Question: 1.6
Suppose $A$ is a finite set with $n$ elements. The number of elements in the largest equivalence relation of A is $n$ $n^2$ $1$ $n+1$
Suppose $A$ is a finite set with $n$ elements. The number of elements in the largest equivalence relation of A is$n$$n^2$$1$$n+1$
User Avatar
40 votes
5 answers
226
GATE CSE 1998 | Question: 1.5
What is the converse of the following assertion? I stay only if you go I stay if you go If I stay then you go If you do not go then I do not stay If I do not stay then you go
What is the converse of the following assertion?I stay only if you goI stay if you goIf I stay then you goIf you do not go then I do not stayIf I do not stay then you go
User Avatar
29 votes
4 answers
227
GATE CSE 2012 | Question: 26
Which of the following graphs is isomorphic to
Which of the following graphs is isomorphic to
User Avatar
53 votes
8 answers
228
GATE CSE 2013 | Question: 27
What is the logical translation of the following statement? "None of my friends are perfect." $∃x(F (x)∧ ¬P(x))$ $∃ x(¬ F (x)∧ P(x))$ $ ∃x(¬F (x)∧¬P(x))$ $ ¬∃ x(F (x)∧ P(x))$
What is the logical translation of the following statement?"None of my friends are perfect."$∃x(F (x)∧ ¬P(x))$$∃ x(¬ F (x)∧ P(x))$$ ∃x(¬F (x)∧¬P(x))$$ ¬�...
User Avatar
25 votes
2 answers
230
GATE CSE 2013 | Question: 25
Which of the following statements is/are TRUE for undirected graphs? P: Number of odd degree vertices is even. Q: Sum of degrees of all vertices is even. P only Q only Both P and Q Neither P nor Q
Which of the following statements is/are TRUE for undirected graphs?P: Number of odd degree vertices is even.Q: Sum of degrees of all vertices is even. P only Q only Both...
User Avatar
13 votes
3 answers
232
GATE CSE 1999 | Question: 14
Show that the formula $\left[(\sim p \vee q) \Rightarrow (q \Rightarrow p)\right]$ is not a tautology. Let $A$ be a tautology and $B$ any other formula. Prove that $(A \vee B)$ is a tautology.
Show that the formula $\left[(\sim p \vee q) \Rightarrow (q \Rightarrow p)\right]$ is not a tautology.Let $A$ be a tautology and $B$ any other formula. Prove that $(A \ve...
User Avatar
38 votes
7 answers
236
GATE CSE 1999 | Question: 2.2
Two girls have picked $10$ roses, $15$ sunflowers and $15$ daffodils. What is the number of ways they can divide the flowers among themselves? $1638$ $2100$ $2640$ None of the above
Two girls have picked $10$ roses, $15$ sunflowers and $15$ daffodils. What is the number of ways they can divide the flowers among themselves?$1638$$2100$$2640$None of th...
User Avatar
39 votes
5 answers
237
GATE CSE 1999 | Question: 1.15
The number of articulation points of the following graph is $0$ $1$ $2$ $3$
The number of articulation points of the following graph is$0$$1$$2$$3$
User Avatar
30 votes
5 answers
238
GATE CSE 1999 | Question: 1.3
The number of binary strings of $n$ zeros and $k$ ones in which no two ones are adjacent is $^{n-1}C_k$ $^nC_k$ $^nC_{k+1}$ None of the above
The number of binary strings of $n$ zeros and $k$ ones in which no two ones are adjacent is$^{n-1}C_k$$^nC_k$$^nC_{k+1}$None of the above
User Avatar
23 votes
2 answers
239
GATE CSE 1999 | Question: 1.2
The number of binary relations on a set with $n$ elements is: $n^2$ $2^n$ $2^{n^2}$ None of the above
The number of binary relations on a set with $n$ elements is:$n^2$$2^n$$2^{n^2}$None of the above
User Avatar
36 votes
6 answers
240
GATE CSE 2005 | Question: 7
The time complexity of computing the transitive closure of a binary relation on a set of $n$ elements is known to be: $O(n)$ $O(n \log n)$ $O \left( n^{\frac{3}{2}} \right)$ $O\left(n^3\right)$
The time complexity of computing the transitive closure of a binary relation on a set of $n$ elements is known to be:$O(n)$$O(n \log n)$$O \left( n^{\frac{3}{2}} \right)...
User Avatar
Page: