Register
Filter

Answers by Bhagirathi

16 votes
162
GATE CSE 2005 | Question: 12, ISRO2009-64
Let $f(x)$ be the continuous probability density function of a random variable $x$, the probability that $a < x \leq b$, is : $f(b-a)$ $f(b) - f(a)$ $\int\limits_a^b f(x) dx$ $\int\limits_a^b xf (x)dx$
Let $f(x)$ be the continuous probability density function of a random variable $x$, the probability that $a < x \leq b$, is :$f(b-a)$$f(b) - f(a)$$\int\limits_a^b f(x) dx...
3 votes
163
GATE CSE 2010 | Question: 2
Newton-Raphson method is used to compute a root of the equation $x^2 - 13 = 0$ with 3.5 as the initial value. The approximation after one iteration is 3.575 3.676 3.667 3.607
Newton-Raphson method is used to compute a root of the equation $x^2 - 13 = 0$ with 3.5 as the initial value. The approximation after one iteration is3.5753.6763.6673.607...
9 votes
164
GATE CSE 2010 | Question: 3
What is the possible number of reflexive relations on a set of $5$ elements? $2^{10}$ $2^{15}$ $2^{20}$ $2^{25}$
What is the possible number of reflexive relations on a set of $5$ elements?$2^{10}$$2^{15}$$2^{20}$$2^{25}$
7 votes
165
GATE CSE 2010 | Question: 4
Consider the set $S = \{1, ω, ω^2\}$, where $ω$ and $ω^2$ are cube roots of unity. If $*$ denotes the multiplication operation, the structure $(S, *)$ forms A Group A Ring An integral domain A field
Consider the set $S = \{1, ω, ω^2\}$, where $ω$ and $ω^2$ are cube roots of unity. If $*$ denotes the multiplication operation, the structure $(S, *)$ formsA GroupA R...
4 votes
167
GATE CSE 2010 | Question: 29
Consider the following matrix $A = \left[\begin{array}{cc}2 & 3\\x & y \end{array}\right]$ If the eigenvalues of A are $4$ and $8$, then $x = 4$, $y = 10$ $x = 5$, $y = 8$ $x = 3$, $y = 9$ $x = -4$, $y =10$
Consider the following matrix $$A = \left[\begin{array}{cc}2 & 3\\x & y \end{array}\right]$$ If the eigenvalues of A are $4$ and $8$, then$x = 4$, $y = 10$$x = 5$, $y = 8...
25 votes
169
GATE CSE 2005 | Question: 10
Let $G$ be a simple connected planar graph with $13$ vertices and $19$ edges. Then, the number of faces in the planar embedding of the graph is: $6$ $8$ $9$ $13$
Let $G$ be a simple connected planar graph with $13$ vertices and $19$ edges. Then, the number of faces in the planar embedding of the graph is:$6$$8$$9$$13$
2 votes
170
GATE CSE 2004 | Question: 87
The language $\left\{a^mb^nc^{m+n} \mid m, n \geq1\right\}$ is regular context-free but not regular context-sensitive but not context free type-0 but not context sensitive
The language $\left\{a^mb^nc^{m+n} \mid m, n \geq1\right\}$ isregularcontext-free but not regularcontext-sensitive but not context freetype-0 but not context sensitive
5 votes
172
GATE CSE 2002 | Question: 1.10
In 8085 which of the following modifies the program counter Only PCHL instruction Only ADD instructions Only JMP and CALL instructions All instructions
In 8085 which of the following modifies the program counterOnly PCHL instructionOnly ADD instructionsOnly JMP and CALL instructionsAll instructions
28 votes
173
GATE CSE 2002 | Question: 1.13
Which of the following is not a form of memory instruction cache instruction register instruction opcode translation look-a-side buffer
Which of the following is not a form of memoryinstruction cacheinstruction registerinstruction opcodetranslation look-a-side buffer
1 votes
174
Please suggest some good online material(other than video) for Data structure? If anyone has idea about NLC(nlcindia.com) GET interview, please suggest what to prepare?
Please suggest some good online material(other than video) for Data structure? If anyone has idea about NLC(www.nlcindia.com) GET interview, please suggest what to prepar...
32 votes
175
GATE CSE 2003 | Question: 23
In a min-heap with $n$ elements with the smallest element at the root, the $7^{th}$ smallest element can be found in time $\Theta (n \log n)$ $\Theta (n)$ $\Theta(\log n)$ $\Theta(1)$
In a min-heap with $n$ elements with the smallest element at the root, the $7^{th}$ smallest element can be found in time$\Theta (n \log n)$$\Theta (n)$$\Theta(\log n)$$\...
6 votes
176
MadeEasy Workbook: Probability
A pair of dice is rolled again and again till a total of 5 or 7 is obtained. The chance that a total of 5 comes before a total of 7 is??
A pair of dice is rolled again and again till a total of 5 or 7 is obtained. The chance that a total of 5 comes before a total of 7 is??
4 votes
177
GATE CSE 2002 | Question: 1.16
Sign extension is a step in floating point multiplication signed $16$ bit integer addition arithmetic left shift converting a signed integer from one size to another
Sign extension is a step in floating point multiplicationsigned $16$ bit integer additionarithmetic left shiftconverting a signed integer from one size to another
0 votes
179
GATE CSE 2006 | Question: 12
To implement Dijkstra’s shortest path algorithm on unweighted graphs so that it runs in linear time, the data structure to be used is: Queue Stack Heap B-Tree
To implement Dijkstra’s shortest path algorithm on unweighted graphs so that it runs in linear time, the data structure to be used is:QueueStackHeapB-Tree
–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}$$
Page: