Highest voted questions in Engineering Mathematics

52 votes
15 answers
91
52 votes
2 answers
92
Find the number of binary strings $w$ of length $2n$ with an equal number of $1's$ and $0's$ and the property that every prefix of $w$ has at least as many $0's$ as $1's....
51 votes
4 answers
97
The maximum number of possible edges in an undirected graph with $n$ vertices and $k$ components is ______.
50 votes
10 answers
99
50 votes
9 answers
101
Let $P(x)$ and $Q(x)$ be arbitrary predicates. Which of the following statements is always TRUE?$\left(\left(\forall x \left(P\left(x\right) \vee Q\left(x\right)\right)\r...
49 votes
11 answers
105
What is the chromatic number of an $n$ vertex simple connected graph which does not contain any odd length cycle? Assume $n 2$.$2$$3$$n-1$ $n$
49 votes
7 answers
107
The eigen vector $(s)$ of the matrix $$\begin{bmatrix} 0 &0 &\alpha\\ 0 &0 &0\\ 0 &0 &0 \end{bmatrix},\alpha \neq 0$$ is (are)$(0,0,\alpha)$$(\alpha,0,0)$$(0,0,1)$$(0,\al...
48 votes
5 answers
109
48 votes
3 answers
110
Show that all vertices in an undirected finite graph cannot have distinct degrees, if the graph has at least two vertices.