Register
Filter

Most viewed questions in Discrete Mathematics

102 votes
11 answers
34
GATE CSE 2016 Set 2 | Question: 01
Consider the following expressions: $false$ $Q$ $true$ $P\vee Q$ $\neg Q\vee P$ The number of expressions given above that are logically implied by $P \wedge (P \Rightarrow Q)$ is ___________.
Consider the following expressions:$false$$Q$$true$$P\vee Q$$\neg Q\vee P$The number of expressions given above that are logically implied by $P \wedge (P \Rightarrow Q)$...
User Avatar
60 votes
5 answers
35
GATE CSE 2007 | Question: 21
How many different non-isomorphic Abelian groups of order $4$ are there? $2$ $3$ $4$ $5$
How many different non-isomorphic Abelian groups of order $4$ are there?$2$$3$$4$$5$
User Avatar
52 votes
15 answers
36
GATE CSE 2015 Set 2 | Question: 40
The number of onto functions (surjective functions) from set $X = \{1, 2, 3, 4\}$ to set $Y=\{a,b,c\}$ is ______.
The number of onto functions (surjective functions) from set $X = \{1, 2, 3, 4\}$ to set $Y=\{a,b,c\}$ is ______.
User Avatar
0 votes
2 answers
38
Discrete Mathematics and Its Applications by Kenneth H. Rosen
From where can i get full solution of Discrete Mathematics and Its Applications by Kenneth H. Rosen ?
From where can i get full solution of Discrete Mathematics and Its Applications by Kenneth H. Rosen ?
User Avatar
39 votes
8 answers
39
GATE CSE 2002 | Question: 1.25, ISRO2008-30, ISRO2016-6
The maximum number of edges in a $n$-node undirected graph without self loops is $n^2$ $\frac{n(n-1)}{2}$ $n-1$ $\frac{(n+1)(n)}{2}$
The maximum number of edges in a $n$-node undirected graph without self loops is$n^2$$\frac{n(n-1)}{2}$$n-1$$\frac{(n+1)(n)}{2}$
User Avatar
57 votes
11 answers
41
GATE CSE 2014 Set 3 | Question: 51
If $G$ is the forest with $n$ vertices and $k$ connected components, how many edges does $G$ have? $\left\lfloor\frac {n}{k}\right\rfloor$ $\left\lceil \frac{n}{k} \right\rceil$ $n-k$ $n-k+1$
If $G$ is the forest with $n$ vertices and $k$ connected components, how many edges does $G$ have?$\left\lfloor\frac {n}{k}\right\rfloor$$\left\lceil \frac{n}{k} \right\r...
User Avatar
19 votes
18 answers
42
GATE CSE 2019 | Question: 21
The value of $3^{51} \text{ mod } 5$ is _____
The value of $3^{51} \text{ mod } 5$ is _____
User Avatar
44 votes
10 answers
43
GATE CSE 2016 Set 2 | Question: 29
The value of the expression $13^{99}\pmod{17}$ in the range $0$ to $16$, is ________.
The value of the expression $13^{99}\pmod{17}$ in the range $0$ to $16$, is ________.
User Avatar
58 votes
9 answers
47
GATE CSE 2017 Set 2 | Question: 47
If the ordinary generating function of a sequence $\left \{a_n\right \}_{n=0}^\infty$ is $\large \frac{1+z}{(1-z)^3}$, then $a_3-a_0$ is equal to ___________ .
If the ordinary generating function of a sequence $\left \{a_n\right \}_{n=0}^\infty$ is $\large \frac{1+z}{(1-z)^3}$, then $a_3-a_0$ is equal to ___________ .
User Avatar
44 votes
9 answers
49
GATE CSE 2017 Set 2 | Question: 23
$G$ is an undirected graph with $n$ vertices and $25$ edges such that each vertex of $G$ has degree at least $3$. Then the maximum possible value of $n$ is _________ .
$G$ is an undirected graph with $n$ vertices and $25$ edges such that each vertex of $G$ has degree at least $3$. Then the maximum possible value of $n$ is _________ .
User Avatar
42 votes
6 answers
50
GATE CSE 2014 Set 2 | Question: 51
A cycle on $n$ vertices is isomorphic to its complement. The value of $n$ is _____.
A cycle on $n$ vertices is isomorphic to its complement. The value of $n$ is _____.
User Avatar
Page: