Hot questions in Engineering Mathematics

44 votes
9 answers
122
$G$ is an undirected graph with $n$ vertices and $25$ edges such that each vertex of $G$ has degree at least $3$. Then the maximum possible value of $n$ is _________ .
35 votes
6 answers
124
39 votes
8 answers
125
52 votes
6 answers
126
How many undirected graphs (not necessarily connected) can be constructed out of a given set $V=\{v_1, v_2, \dots v_n\}$ of $n$ vertices?$\frac{n(n-1)} {2}$$2^n$$n!$$2^\f...
35 votes
6 answers
127
Consider the following system of equations: $3x + 2y = 1 $$4x + 7z = 1 $$x + y + z = 3$$x - 2y + 7z = 0$The number of solutions for this system is ______________
49 votes
11 answers
129
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$
60 votes
6 answers
130
Let ܵ$S$ denote the set of all functions $f:\{0,1\}^4 \to \{0,1\}$. Denote by $N$ the number of functions from S to the set $\{0,1\}$. The value of $ \log_2 \log_2N $ is...
22 votes
5 answers
131
Let $X = \{2, 3, 6, 12, 24\}$, Let $\leq$ be the partial order defined by $X \leq Y$ if $x$ divides $y$. Number of edges in the Hasse diagram of $(X, \leq)$ is$3$$4$$9$No...
38 votes
7 answers
132
Two girls have picked $10$ roses, $15$ sunflowers and $15$ daffodils. What is the number of ways they can divide the flowers among themselves?$1638$$2100$$2640$None of th...
49 votes
7 answers
135
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...
0 votes
2 answers
136
29 votes
8 answers
137
The determinant of the matrix given below is$$\begin{bmatrix}0 &1 &0 &2 \\ -1& 1& 1& 3\\ 0&0 &0 & 1\\ 1& -2& 0& 1\end{bmatrix}$$$-1$$0$$1$$2$