Register
Filter

Highest voted questions in Engineering Mathematics

2 votes
0 answers
2701
No of symmetric relations
No of Symmetric relations containg set with A={1,2,3,4,5,6,7} which contain exactly four ordered pairs.
No of Symmetric relations containg set with A={1,2,3,4,5,6,7} which contain exactly four ordered pairs.
User Avatar
2 votes
1 answer
2702
graph theory
Assumed undirected graph G is connected. G has 6­vertices and 10 edges. Find the minimum number of edges whose deletion from graph G is always guarantee that it will become disconnected.
Assumed undirected graph G is connected. G has 6­vertices and 10 edges. Findthe minimum number of edges whose deletion from graph G is always guaranteethat ...
User Avatar
2 votes
1 answer
2703
Number of ways ... distinguishable into distinguishable.
How many ways can n books be placed on k distinguishable shelves if no two books are same and the position of the books on the shelves matter.
How many ways can n books be placed on k distinguishable shelves if no two books are same and the position of the books on the shelves matter.
User Avatar
2 votes
1 answer
2704
recurrence relation
is it correct way to solve this? if not then please provide me the solution
is it correct way to solve this?if not then please provide me the solution
User Avatar
2 votes
1 answer
2705
First Order Logic
User Avatar
2 votes
1 answer
2707
Poisson Distribution
If 20 markers are drawn from a large number of markers in which 10% are red markers. What is the probability that the number of red markers drawn exceeds the expected number of red markers. (Use Poisson approximation and Binomial theorem). (Upto 3 decimal places)
If 20 markers are drawn from a large number of markers in which 10% are red markers. What is the probability that the number of red markers drawn exceeds the expected num...
User Avatar
2 votes
1 answer
2708
MATCHING NUMBER
what is the matching number of $K_{2,3}$ graph.and also explain matching number of $K_{m,n}$(simplification).
what is the matching number of $K_{2,3}$ graph.and also explain matching number of $K_{m,n}$(simplification).
User Avatar
2 votes
2 answers
2709
CMI2016-B-7aii
Consider the funciton $M$ defined as follows: $M(n) = \begin{cases} n-10 & \text{ if } n > 100 \\ M(M(n+11)) & \text{ if } n \leq 100 \end{cases}$ Compute the following$: M(99)$
Consider the funciton $M$ defined as follows:$M(n) = \begin{cases} n-10 & \text{ if } n 100 \\ M(M(n+11)) & \text{ if } n \leq 100 \end{cases}$Compute the following$: M(...
User Avatar
2 votes
2 answers
2711
graph theory
User Avatar
2 votes
1 answer
2714
connectivity
Consider a simple connected undirected graph G which has m vertices and n edges. Which of the following condition always guarantee that after removal of those number of edges graph will be disconnected? a)m – n + 2 b)$_{2}^{m}\textrm{C}-n+2$ c)n – 2 d)None of the above
Consider a simple connected undirected graph G which has m vertices and n edges. Which of the following condition always guarantee that after removal of those number of e...
User Avatar
2 votes
1 answer
2715
Maths
There are 2 white and 4 black balls in urn A; in urn B, there are 4 white and 7 black balls. If one ball is randomly replaced from A into B and a ball is drawn from B then find the probability for the ball to be a white one?
There are 2 white and 4 black balls in urn A; in urn B, there are 4 white and 7 black balls. If one ball is randomly replaced from A into B and a ball is drawn from B the...
User Avatar
2 votes
1 answer
2716
maths
User Avatar
2 votes
0 answers
2717
GATE CSE 1988 | Question: 13ib
Verify whether the following mapping is a homomorphism. If so, determine its kernel. $\overline{G}=G$
Verify whether the following mapping is a homomorphism. If so, determine its kernel.$\overline{G}=G$
User Avatar
Page: