Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Recent questions in Engineering Mathematics
4
votes
1
answer
7461
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
go_editor
7.1k
views
go_editor
asked
Aug 20, 2016
Combinatory
ugcnetcse-june2016-paper3
combinatory
binary-tree
+
–
2
votes
1
answer
7462
UGC NET CSE | December 2011 | Part 2 | Question: 34
Negative numbers cannot be represented in Signed magnitude form $1’s$ complement form $2’s$ complement form None of the above
Negative numbers cannot be represented inSigned magnitude form$1’s$ complement form$2’s$ complement formNone of the above
makhdoom ghaya
2.7k
views
makhdoom ghaya
asked
Aug 19, 2016
Discrete Mathematics
ugcnetcse-dec2011-paper2
discrete-mathematics
number-representation
+
–
1
votes
2
answers
7463
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)) ...
vijaycs
1.4k
views
vijaycs
asked
Aug 19, 2016
Mathematical Logic
mathematical-logic
first-order-logic
+
–
3
votes
2
answers
7464
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
Sarvottam Patel
649
views
Sarvottam Patel
asked
Aug 19, 2016
Mathematical Logic
graph-connectivity
+
–
2
votes
1
answer
7465
eigen vector
Let A be the matrix [3112][3112]. What is the maximum value of xT Ax where the maximum is taken over all x that are the unit eigenvectors of A? A) 3 B) (5 + √5)/2 C) 3 D) (5 - √5)/2 PLEASE EXPLAIN THE MEANING OF UNIT EIGENVECTORS OF A
Let A be the matrix [3112][3112]. What is the maximum value of xT Ax where the maximum is taken over all x that are the unit eigenvectors of A?A)3B)(5 + √5)/2C)3D)(...
indrajeet
614
views
indrajeet
asked
Aug 19, 2016
Linear Algebra
engineering-mathematics
linear-algebra
eigen-value
+
–
2
votes
0
answers
7466
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.
LavTheRawkstar
271
views
LavTheRawkstar
asked
Aug 19, 2016
1
votes
1
answer
7467
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 :
LavTheRawkstar
255
views
LavTheRawkstar
asked
Aug 19, 2016
1
votes
0
answers
7468
Logic
Consider the following logic program P A(x) <- B(x, y), C(y) <- B(x,x) Which of the following first order sentences is equivalent to P? option- A - (∀x)[(∃y)[B(x,y)∧C(y)]⇒A(x)]∧¬(∃X)[B(x,x)] B- (∀x)[(∀y)[B(x,y)∧C(y)]⇒A(x)]∧¬(∃X)[B(x,x)] C- (∀x)[(∃y)[B(x,y)∧C(y)]⇒A(x)]∨¬(∃X)[B(x,x)] D- (∀x)[(∀y)[B(x,y)∧C(y)]⇒A(x)]∧(∃X)[B(x,x)]
Consider the following logic program P A(x) <- B(x, y), C(y) <- B(x,x) Which of the following first order sentences is equivalent to P?option-A - (∀x)[(∃y)[B(x,y)∧C...
Sarvottam Patel
337
views
Sarvottam Patel
asked
Aug 19, 2016
Mathematical Logic
mathematical-logic
first-order-logic
+
–
3
votes
1
answer
7469
UGC NET CSE | December 2011 | Part 2 | Question: 27
The multiuser operating system, $20$ requests are made to use a particular resource per hour, on an average the probability that no request are made in $45$ minutes is $e^{-15}$ $e^{-5}$ $1 – e^{-5}$ $1 – e^{-10}$
The multiuser operating system, $20$ requests are made to use a particular resource per hour, on an average the probability that no request are made in $45$ minutes is$e^...
makhdoom ghaya
3.7k
views
makhdoom ghaya
asked
Aug 17, 2016
Probability
ugcnetcse-dec2011-paper2
probability
poisson-distribution
+
–
1
votes
2
answers
7470
MADEEASY Doubt Matrix
If A is a Skew Symmetric MAtrix then A.A is_______ a)symmetric b)skew-symmetric c)Diagonal d)nothing can be said
If A is a Skew Symmetric MAtrix then A.A is_______a)symmetric b)skew-symmetric c)Diagonal d)nothing can be said
Aboveallplayer
912
views
Aboveallplayer
asked
Aug 16, 2016
5
votes
3
answers
7471
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
go_editor
6.7k
views
go_editor
asked
Aug 16, 2016
Combinatory
ugcnetcse-june2016-paper2
parenthesization
combinatory
+
–
1
votes
0
answers
7472
made easy test series que
a real n*n matrix aij =i if i = j , otherwise 0 the determinant of all n eigen values of A is a) n(n+1)/2 b) n(n-1)/2 c) n(n+1)(2n+1)/6 d) factorial(n) my ans is d but the ans given is a. Is it correct?
a real n*n matrix aij =i if i = j , otherwise 0the determinant of all n eigen values of A isa) n(n+1)/2b) n(n-1)/2c) n(n+1)(2n+1)/6d) factorial(n)my ans is d but the ans ...
qwertyui
884
views
qwertyui
asked
Aug 15, 2016
1
votes
0
answers
7473
#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...
Sarvottam Patel
584
views
Sarvottam Patel
asked
Aug 15, 2016
Graph Theory
graph-theory
+
–
3
votes
1
answer
7474
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.
Sarvottam Patel
4.0k
views
Sarvottam Patel
asked
Aug 15, 2016
Graph Theory
graph-theory
+
–
2
votes
2
answers
7475
Graph
consider G is an undirected simple graph in which
consider G is an undirected simple graph in which
Hira Thakur
430
views
Hira Thakur
asked
Aug 14, 2016
Graph Theory
graph-theory
graph-connectivity
+
–
6
votes
2
answers
7476
UGC NET CSE | June 2016 | Part 2 | Question: 4
There are three cards in a box. Both sides of one card are black, both sides of one card are red and the third card has one black side and one red side. We pick a card at random and observe only one side. What is the probability that the opposite side is the same colour as the one side we observed? 3/4 2/3 1/2 1/3
There are three cards in a box. Both sides of one card are black, both sides of one card are red and the third card has one black side and one red side. We pick a card at...
go_editor
2.8k
views
go_editor
asked
Aug 14, 2016
Probability
ugcnetcse-june2016-paper2
engineering-mathematics
probability
+
–
4
votes
2
answers
7477
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
go_editor
3.8k
views
go_editor
asked
Aug 14, 2016
Set Theory & Algebra
ugcnetcse-june2016-paper2
discrete-mathematics
set-theory&algebra
+
–
2
votes
1
answer
7478
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$
makhdoom ghaya
2.2k
views
makhdoom ghaya
asked
Aug 13, 2016
Graph Theory
ugcnetcse-dec2011-paper2
graph-theory
graph-connectivity
+
–
3
votes
1
answer
7479
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}$
makhdoom ghaya
785
views
makhdoom ghaya
asked
Aug 12, 2016
Graph Theory
ugcnetcse-dec2011-paper2
graph-theory
graph-connectivity
+
–
2
votes
1
answer
7480
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...
makhdoom ghaya
1.5k
views
makhdoom ghaya
asked
Aug 12, 2016
Discrete Mathematics
ugcnetcse-dec2011-paper2
discrete-mathematics
functions
+
–
Page:
« prev
1
...
369
370
371
372
373
374
375
376
377
378
379
...
524
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register