Register
Filter

Answers by Bhagirathi

–5 votes
181
GATE CSE 2004 | Question: 77
The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same color, is $2$ $3$ $4$ $5$
The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same color, is$2$$3$$4$$5$
5 votes
182
GATE CSE 2006 | Question: 1, ISRO2009-57
Consider the polynomial $p(x) = a_0 + a_1x + a_2x^2 + a_3x^3$ , where $a_i \neq 0$, $\forall i$. The minimum number of multiplications needed to evaluate $p$ on an input $x$ is: 3 4 6 9
Consider the polynomial $p(x) = a_0 + a_1x + a_2x^2 + a_3x^3$ , where $a_i \neq 0$, $\forall i$. The minimum number of multiplications needed to evaluate $p$ on an input ...
2 votes
185
GATE CSE 2002 | Question: 1.2
The trapezoidal rule for integration gives exact result when the integrand is a polynomial of degree 0 but not 1 1 but not 0 0 or 1 2
The trapezoidal rule for integration gives exact result when the integrand is a polynomial of degree0 but not 11 but not 00 or 12
49 votes
186
GATE CSE 2002 | Question: 1.25, ISRO2008-30, ISRO2016-6
The maximum number of edges in a $n$-node undirected graph without self loops is $n^2$ $\frac{n(n-1)}{2}$ $n-1$ $\frac{(n+1)(n)}{2}$
The maximum number of edges in a $n$-node undirected graph without self loops is$n^2$$\frac{n(n-1)}{2}$$n-1$$\frac{(n+1)(n)}{2}$
20 votes
187
GATE CSE 2002 | Question: 1.1
The rank of the matrix $\begin{bmatrix} 1 & 1 \\ 0 & 0 \end{bmatrix}$ is $4$ $2$ $1$ $0$
The rank of the matrix $\begin{bmatrix} 1 & 1 \\ 0 & 0 \end{bmatrix}$ is$4$$2$$1$$0$
23 votes
188
GATE CSE 2004 | Question: 83, ISRO2015-40
The time complexity of the following C function is (assume $n > 0$) int recursive (int n) { if(n == 1) return (1); else return (recursive (n-1) + recursive (n-1)); } $O(n)$ $O(n \log n)$ $O(n^2)$ $O(2^n)$
The time complexity of the following C function is (assume $n 0$)int recursive (int n) { if(n == 1) return (1); else return (recursive (n-1) + recursive (n-1)); }$O(n)$$...
30 votes
189
GATE CSE 2004 | Question: 86
The following finite state machine accepts all those binary strings in which the number of $1$’s and $0$’s are respectively: divisible by $3$ and $2$ odd and even even and odd divisible by $2$ and $3$
The following finite state machine accepts all those binary strings in which the number of $1$’s and $0$’s are respectively: divisible by $3$ and $2$odd and evene...
1 votes
190
GATE CSE 2002 | Question: 5a
Obtain the eigen values of the matrix$A=\begin {bmatrix} 1 & 2 & 34 & 49 \\ 0 & 2 & 43 & 94 \\ 0 & 0 & -2 & 104 \\ 0 & 0 & 0 & -1 \end{bmatrix}$
Obtain the eigen values of the matrix$$A=\begin {bmatrix} 1 & 2 & 34 & 49 \\ 0 & 2 & 43 & 94 \\ 0 & 0 & -2 & 104 \\ 0 & 0 & 0 & -1 \end{bmatrix}$$
1 votes
191
GATE CSE 2002 | Question: 2.15
The Newton-Raphson iteration $X_{n+1} = (\frac{X_n}{2}) + \frac{3}{(2X_n)}$ can be used to solve the equation $X^2 =3$ $X^3 =3$ $X^2 =2$ $X^3 =2$
The Newton-Raphson iteration $X_{n+1} = (\frac{X_n}{2}) + \frac{3}{(2X_n)}$ can be used to solve the equation$X^2 =3$$X^3 =3$$X^2 =2$$X^3 =2$
–1 votes
192
GATE CSE 2002 | Question: 2.16
Four fair coins are tossed simultaneously. The probability that at least one head and one tail turn up is $\frac{1}{16}$ $\frac{1}{8}$ $\frac{7}{8}$ $\frac{15}{16}$
Four fair coins are tossed simultaneously. The probability that at least one head and one tail turn up is$\frac{1}{16}$$\frac{1}{8}$$\frac{7}{8}$$\frac{15}{16}$
2 votes
193
GATE CSE 1992 | Question: 02,vii
A $2-3$ tree is such that All internal nodes have either $2$ or $3$ children All paths from root to the leaves have the same length The number of internal nodes of a $2-3$ tree having $9$ leaves could be $4$ $5$ $6$ $7$
A $2-3$ tree is such thatAll internal nodes have either $2$ or $3$ childrenAll paths from root to the leaves have the same lengthThe number of internal nodes of a $2-3$ t...
Page: