Register
Filter

Recent questions in Discrete Mathematics

4 votes
1 answer
5341
UGC NET CSE | June 2016 | Part 3 | Question: 31
The number of different binary trees with 6 nodes is 6 42 132 256
The number of different binary trees with 6 nodes is642132256
User Avatar
1 votes
2 answers
5343
Propositional Logic | Self doubt
Please give one example of each following logic in english sentence - 1. ($\forall$xP(x) -> $\exists$xQ(x)) == $\exists$x(P(x) -> Q(x)) 2. ($\exists$xP(x) -> $\forall$xQ(x)) -> $\forall$x(P(x) -> Q(x)) 3. $\forall$x(P(x) -> R) -> ($\exists$xP(x) -> R)
Please give one example of each following logic in english sentence -1. ($\forall$xP(x) - $\exists$xQ(x)) == $\exists$x(P(x) - Q(x))2. ($\exists$xP(x) - $\forall$xQ(x)) ...
User Avatar
3 votes
2 answers
5344
Gatebook
Let A has n vertices. If Ā is connected graph then the maximum number of edges that A can have is a) (n-1)(n-2)/2 b) n(n-1)/2 c) n-1 d) n
Let A has n vertices. If Ā is connected graph then the maximum number of edges that A can have isa) (n-1)(n-2)/2b) n(n-1)/2c) n-1d) n
User Avatar
2 votes
0 answers
5345
Discrete Mathematics Imp
In the set of all integers a relation is defined by: a $\equiv$ b(mod m) i.e. m divides a-b Show that:The relation is an Equivalance Relation.
In the set of all integers a relation is defined by:a $\equiv$ b(mod m)i.e. m divides a-bShow that:The relation is an Equivalance Relation.
User Avatar
1 votes
1 answer
5346
Discrete MatheMatics Imp
If A,B,C are 3 sets and R is a subset of A x B i.e R ⊆ A x B S ⊆ B x C Then Prove that :
If A,B,C are 3 sets and R is a subset of A x Bi.e R ⊆ A x BS ⊆ B x CThen Prove that :
User Avatar
5 votes
3 answers
5348
UGC NET CSE | June 2016 | Part 2 | Question: 25
In how many ways can the string $A \cap B - A \cap B -A$ be fully paranthesized to yield an infix expression? 15 14 13 12
In how many ways can the string $A \cap B - A \cap B -A$ be fully paranthesized to yield an infix expression?15141312
User Avatar
1 votes
0 answers
5349
#Narsingh_Deo Chapter-2 problem 2-29
Show that in a dancing ring of n children it is always possible to arrange the children so that everyone has a friend at each side if every child enjoys friendship with at least half the children.
Show that in a dancing ring of n children it is always possible to arrange the children so that everyone has a friend at each side if every child enjoys friendship with a...
User Avatar
3 votes
1 answer
5350
Narsingh Deo , Chapter 2, problem 2-18
If the intersection of two path is a disconnected graph, Show that the union of the two path has at least one circuit.
If the intersection of two path is a disconnected graph, Show that the union of the two path has at least one circuit.
User Avatar
2 votes
2 answers
5351
Graph
consider G is an undirected simple graph in which
consider G is an undirected simple graph in which
User Avatar
4 votes
2 answers
5352
UGC NET CSE | June 2016 | Part 2 | Question: 1
How many difference equivalence relations with exactly three different equivalence classes are there on a set with five elements? 10 15 25 30
How many difference equivalence relations with exactly three different equivalence classes are there on a set with five elements?10152530
User Avatar
2 votes
1 answer
5353
UGC NET CSE | December 2011 | Part 2 | Question: 15
McCabe’s cyclomatic metric $V(G)$ of a graph $G$ with $n$ vertices, $e$ edges and $p$ connected component is $e$ $n$ $e – n + p$ $e – n + 2p$
McCabe’s cyclomatic metric $V(G)$ of a graph $G$ with $n$ vertices, $e$ edges and $p$ connected component is$e$ $n$ $e – n + p$ $e – n + 2p$
User Avatar
3 votes
1 answer
5354
UGC NET CSE | December 2011 | Part 2 | Question: 5
Maximum number of edges in a n -Node undirected graph without self loop is $n^{2}$ $n(n – 1)$ $n(n + 1)$ $\frac{n(n - 1)}{2}$
Maximum number of edges in a n -Node undirected graph without self loop is$n^{2}$$n(n – 1)$ $n(n + 1)$$\frac{n(n - 1)}{2}$
User Avatar
2 votes
1 answer
5355
UGC NET CSE | December 2011 | Part 2 | Question: 4
Domain and Range of the function $Y= - \sqrt{-2x + 3}$ is $x \geq \frac{3}{2}, y \geq 0$ $x > \frac{3}{2}, y \leq 0$ $x \geq \frac{3}{2}, y \leq 0$ $x \leq \frac{3}{2}, y \leq 0$
Domain and Range of the function $Y= - \sqrt{-2x + 3}$ is$x \geq \frac{3}{2}, y \geq 0$$x \frac{3}{2}, y \leq 0$$x \geq \frac{3}{2}, y \leq 0$ $x \leq \frac{3}{2}, y \le...
User Avatar
3 votes
5 answers
5357
UGC NET CSE | December 2015 | Part 3 | Question: 44
In propositional logic, given $P$ and $P \rightarrow Q$, we can infer ________ $\sim Q$ $Q$ $P \wedge Q$ $\sim P \wedge Q$
In propositional logic, given $P$ and $P \rightarrow Q$, we can infer ________$\sim Q$$Q$$P \wedge Q$$\sim P \wedge Q$
User Avatar
3 votes
2 answers
5358
Graph theory
complement of a complete bipartite graph Km,n .please provide a figure for explanation.
complement of a complete bipartite graph Km,n .please provide a figure for explanation.
User Avatar
2 votes
3 answers
5359
made easy
Please explain how perfect matching in given tree is 1? Why not 3 with edges ab,ce,df?
Please explain how perfect matching in given tree is 1?Why not 3 with edges ab,ce,df?
User Avatar
2 votes
1 answer
5360
predicate
B(x):x is a boy C(x):x is a chocolates E(x,y): x eats y. "only boy eats chocolates". write this statement using predicate calculus.
B(x):x is a boyC(x):x is a chocolatesE(x,y): x eats y."only boy eats chocolates". write this statement using predicate calculus.
User Avatar
Page: