Register
Filter

Answers by suraj

4 votes
1
GATE CSE 1998 | Question: 9
Derive the expressions for the number of operations required to solve a system of linear equations in $n$ unknowns using the Gaussian Elimination Method. Assume that one operation refers to a multiplication followed by an addition.
Derive the expressions for the number of operations required to solve a system of linear equations in $n$ unknowns using the Gaussian Elimination Method. Assume that one ...
2 votes
3
Sorting
Two unsorted arrays of size m and n are to be sorted into a single array, what is best case time complexity?
Two unsorted arrays of size m and n are to be sorted into a single array, what is best case time complexity?
12 votes
9
GATE_2014 ME
Consider a 3 x 3 real symmetric matrix S such that two of its eigen values are a ≠ 0 , b ≠ 0 with respective Eigen vectors [ x1 x2 x3 ] , [ y1 y2 y3 ] . If a ≠ b then x1y1 + x2y2 + x3y3 is a) a b) b c) ab d) 0
Consider a 3 x 3 real symmetric matrix S such that two of its eigen values are a ≠ 0 , b ≠ 0 with respective Eigen vectors [ x1 x2 x3 ] , [ y1 y2 y3 ] . If a &ne...
0 votes
11
A is a 4-square matrix and A 5 = 0. Then
A is a 4-square matrix and A_5 (a raised to the power of 5) = 0. Then A_4 = a) I b) -I c) 0 d) A
A is a 4-square matrix and A_5 (a raised to the power of 5) = 0. Then A_4 =a) Ib) -Ic) 0d) A
0 votes
13
is there any short cut to find the determinant of the matrix
1 0 0 0 0 2 0 1 0 0 2 0 0 0 1 2 0 0 0 0 2 1 0 0 0 2 0 0 1 0 2 0 0 0 0 1
1 0 0 0 0 20 1 0 0 2 00 0 1 2 0 00 0 2 1 0 00 2 0 0 1 02 0 0 0 0 1
4 votes
15
Value of a^2+b^2 ?
70 votes
17
GATE CSE 2005 | Question: 11
Let $G$ be a simple graph with $20$ vertices and $100$ edges. The size of the minimum vertex cover of G is $8$. Then, the size of the maximum independent set of $G$ is: $12$ $8$ less than $8$ more than $12$
Let $G$ be a simple graph with $20$ vertices and $100$ edges. The size of the minimum vertex cover of G is $8$. Then, the size of the maximum independent set of $G$ is:$1...
15 votes
19
TIFR CSE 2010 | Part A | Question: 18
Let $X$ be a set of size $n$. How many pairs of sets (A, B) are there that satisfy the condition $A\subseteq B \subseteq X$ ? $2^{n+1}$ $2^{2n}$ $3^{n}$ $2^{n} + 1$ $3^{n + 1}$
Let $X$ be a set of size $n$. How many pairs of sets (A, B) are there that satisfy the condition $A\subseteq B \subseteq X$ ?$2^{n+1}$$2^{2n}$$3^{n}$$2^{n} + 1$$3^{n + 1}...
2 votes
20
dgital
Which of the following multiplier pattern of boothe algo gives better performance and how: 1..01111111110 2..1111100011111 3..011111011111 4..111111111000
Which of the following multiplier pattern of boothe algo gives better performance and how:1..011111111102..11111000111113..0111110111114..111111111000
6 votes
24
Self Doubt: Permutations & Combinations
How many solutions are there to the equation $x+y+z=17$ in positive integers? $120$ $171$ $180$ $121$
How many solutions are there to the equation $x+y+z=17$ in positive integers?$120$$171$$180$$121$
1 votes
28
What is the complexity of finding 50th smallest element in an already constructed binary min-heap?
What is the complexity of finding $50^{th}$ smallest element in an already constructed binary min-heap? $\Theta(1)$ $\Theta (\log n)$ $\Theta (n)$ $\Theta (n \log n)$
What is the complexity of finding $50^{th}$ smallest element in an already constructed binary min-heap?$\Theta(1)$$\Theta (\log n)$$\Theta (n)$$\Theta (n \log n)$
Page: