Register
Filter

Recent questions in Engineering Mathematics

1 votes
1 answer
7411
Relation
How many non zero entries does the matrix representing relation $R$ on a set $A$ = $\left \{ 1,2,3,4,5,6....1000 \right \}$. a. $R = \left \{ (x,y) \; | x = y \pm 1 \right \}$ b. $R = \left \{ (x,y) \; | x + y = 1000 \right \}$
How many non zero entries does the matrix representing relation $R$ on a set $A$ = $\left \{ 1,2,3,4,5,6....1000 \right \}$.a. $R = \left \{ (x,y) \; | x = y \pm 1 \right...
User Avatar
0 votes
0 answers
7412
Equivalence relation
True / false ? a. Partitions formed from congruence classes modulo $6$ ... $R_4$ creates refinement partitions with respect to the partitions of $R_3$.
True / false ?a. Partitions formed from congruence classes modulo $6$ is a refinement of the partitions formed from congruence classes modulo 3s and t are bit strings and...
User Avatar
0 votes
1 answer
7414
Divisibility
It is being given that (232 + 1) is completely divisible by a whole number. Which of the following numbers is completely divisible by this number? A.(216 + 1). B.(216 - 1). C.(7 x 223). D.(296 + 1)
It is being given that (232 + 1) is completely divisible by a whole number. Which of the following numbers is completely divisible by this number?A.(216 + 1). ...
User Avatar
0 votes
0 answers
7415
Gate 2006
Qus 1 Qus 2
Qus 1Qus 2
User Avatar
0 votes
1 answer
7416
Gate 2016
User Avatar
2 votes
1 answer
7417
Gate 2014
Qus 1 Qus2
Qus 1Qus2
User Avatar
0 votes
0 answers
7418
ME FLT-1 Q-10
i have used hypergeometric distribution but MADE Easy have used binomial theorem..we should use binomial when replacement are done na? my ans.0.6 made easy ans:0.81
i have used hypergeometric distribution but MADE Easy have used binomial theorem..we should use binomial when replacement are done na?my ans.0.6made easy ans:0.81
User Avatar
1 votes
2 answers
7419
Probablity Problem
User Avatar
0 votes
1 answer
7420
eularian circuit
Suppose a connected graph has 15 labeled nodes, given that it has an eularian circuit, what is the minimum number of distinct circuits which it must have? [Note : the circuit a->b->c->a is not same as b->c->a->b]
Suppose a connected graph has 15 labeled nodes, given that it has an eularian circuit, what is the minimum number of distinct circuits which it must have? [Note : the cir...
User Avatar
0 votes
0 answers
7422
Graph theory
proof :- A connected graph any two paths of maximum length share at least one vertex
proof :- A connected graph any two paths of maximum length share at least one vertex
User Avatar
0 votes
0 answers
7423
logic.
i am thinking none is correct. bcoz a and b gives true when there is no honest person c is not true.. as it implies "if someone likes someone then he is honest"
i am thinking none is correct.bcoz a and b gives true when there is no honest personc is not true.. as it implies "if someone likes someone then he is honest"
User Avatar
0 votes
0 answers
7424
eularian circuit
Suppose a connected graph has 15 labeled nodes, given that it has an eularian circuit, what is the minimum number of distinct circuits which it must have? [Note : the circuit a->b->c->a is not same as b->c->a->b]
Suppose a connected graph has 15 labeled nodes, given that it has an eularian circuit, what is the minimum number of distinct circuits which it must have? [Note : the cir...
User Avatar
0 votes
1 answer
7425
Hamiltonian cycles
Number of distinct Hamiltonian cycles are there in a unlabeled complete graph K6______ [Note : the path a->b->c is same as b->c->a]
Number of distinct Hamiltonian cycles are there in a unlabeled complete graph K6______ [Note : the path a->b->c is same as b->c->a]
User Avatar
1 votes
3 answers
7426
Planar graph
The total number of planar graphs can be formed with 5 vertices are _____
The total number of planar graphs can be formed with 5 vertices are _____
User Avatar
0 votes
0 answers
7427
Directed graph
How many distinct directed graphs are there nodes labeled 1, 2, 3, 4? [consider graphs with no multiple edges and loops]
How many distinct directed graphs are there nodes labeled 1, 2, 3, 4? [consider graphs with no multiple edges and loops]
User Avatar
0 votes
0 answers
7428
graph components
Let G be the graph whose vertex is the set of K-tuples with elements in {0, 1}, with x adjacent to y, if x and y different in exactly two positions. The number of components of G _____ 1 2 3 4
Let G be the graph whose vertex is the set of K-tuples with elements in {0, 1}, with x adjacent to y, if x and y different in exactly two positions. The number of compone...
User Avatar
2 votes
1 answer
7430
matrix
If A3x3 is a matrix with |A| = 2. What is the determinant of Adj (Adj (Adj A))?
If A3x3 is a matrix with |A| = 2. What is the determinant of Adj (Adj (Adj A))?
User Avatar
Page: