Recent activity by suraj / GATE Overflow for GATE CSE

1 answer

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 ...

3.3k views

answered Jun 20, 2019

4 answers

2

GATE CSE 1999 | Question: 1.1
Suppose that the expectation of a random variable $X$ is $5$. Which of the following statements is true? There is a sample point at which $X$ has the value $5$. There is a sample point at which $X$ has value greater than $5$. There is a sample point at which $X$ has a value greater than equal to $5$. None of the above.

Suppose that the expectation of a random variable $X$ is $5$. Which of the following statements is true?There is a sample point at which $X$ has the value $5$.There is a ...

10.1k views

commented Mar 23, 2019

9 answers

3

GATE CSE 2017 Set 1 | Question: 3
Let $c_{1}.....c_{n}$ be scalars, not all zero, such that $\sum_{i=1}^{n}c_{i}a_{i}$ = 0 where $a_{i}$ are column vectors in $R^{n}$. Consider the set of linear equations $Ax = b$ ... has a unique solution at $x=J_{n}$ where $J_{n}$ denotes a $n$-dimensional vector of all 1. no solution infinitely many solutions finitely many solutions

Let $c_{1}.....c_{n}$ be scalars, not all zero, such that $\sum_{i=1}^{n}c_{i}a_{i}$ = 0 where $a_{i}$ are column vectors in $R^{n}$.Consider the set of linear equations$...

20.3k views

commented Jan 24, 2019

12 answers

4

GATE CSE 2014 Set 1 | Question: 42
Consider the following pseudo code. What is the total number of multiplications to be performed? D = 2 for i = 1 to n do for j = i to n do for k = j + 1 to n do D = D * 3 Half of the product of the $3$ consecutive integers. One-third of the product of the $3$ consecutive integers. One-sixth of the product of the $3$ consecutive integers. None of the above.

Consider the following pseudo code. What is the total number of multiplications to be performed?D = 2 for i = 1 to n do for j = i to n do for k = j + 1 to n do D = D * 3H...

34.6k views

commented Oct 27, 2018

6 answers

5

GATE CSE 2017 Set 1 | Question: 31
Let $A$ be $n\times n$ real valued square symmetric matrix of rank $2$ with $\sum_{i=1}^{n}\sum_{j=1}^{n}A^{2}_{ij} = 50.$ Consider the following statements. One eigenvalue must be in $\left [ -5,5 \right ]$ The eigenvalue ... than $5$ Which of the above statements about eigenvalues of $A$ is/are necessarily CORRECT? Both I and II I only II only Neither I nor II

Let $A$ be $n\times n$ real valued square symmetric matrix of rank $2$ with $\sum_{i=1}^{n}\sum_{j=1}^{n}A^{2}_{ij} = 50.$ Consider the following statements.One eigenvalu...

49.6k views

commented May 23, 2018

3 answers

6

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?

937 views

commented Mar 16, 2018

7 answers

7

GATE CSE 2018 | Question: 30
Let $G$ be a simple undirected graph. Let $T_D$ be a depth first search tree of $G$. Let $T_B$ be a breadth first search tree of $G$. Consider the following statements. No edge of $G$ is a cross edge with respect to $T_D$. (A cross edge in $G$ ... $\mid i-j \mid =1$. Which of the statements above must necessarily be true? I only II only Both I and II Neither I nor II

Let $G$ be a simple undirected graph. Let $T_D$ be a depth first search tree of $G$. Let $T_B$ be a breadth first search tree of $G$. Consider the following statements.No...

27.3k views

commented Feb 18, 2018

7 answers

8

GATE CSE 2018 | Question: 26
Consider a matrix P whose only eigenvectors are the multiples of $\begin{bmatrix} 1 \\ 4 \end{bmatrix}$. Consider the following statements. P does not have an inverse P has a repeated eigenvalue P cannot be diagonalized Which one of the ... III are necessarily true Only II is necessarily true Only I and II are necessarily true Only II and III are necessarily true

Consider a matrix P whose only eigenvectors are the multiples of $\begin{bmatrix} 1 \\ 4 \end{bmatrix}$.Consider the following statements.P does not have an inverseP has ...

27.4k views

commented Feb 15, 2018

1 answer

9

Maths: Linear Algebra
Any shortcut?

Any shortcut?

637 views

commented Nov 6, 2017

2 answers

10

GATE CSE 1997 | Question: 1.9
The conditional expansion facility of macro processor is provided to test a condition during the execution of the expanded program to expand certain model statements depending upon the value of a condition during the execution of the expanded ... recursion to expand certain model statements depending upon the value of a condition during the process of macro expansion

The conditional expansion facility of macro processor is provided totest a condition during the execution of the expanded programto expand certain model statements depend...

5.1k views

commented Oct 20, 2017

2 answers

11

JNUEE-2016
Consider an undirected graph G with 100 nodes. What is the maximum number of edges to be included in G so that graph is connected? (a) 2451 (b) 4851 (c) 4950 (d) 9990

Consider an undirected graph G with 100 nodes. What is the maximum number of edges to be included in G so that graph is connected?(a) 2451(b) 4851(c) 4950(d) 9990

888 views

commented Apr 3, 2017

9 answers

12

GATE CSE 2017 Set 1 | Question: 51
Consider a $2$-way set associative cache with $256$ blocks and uses $\text{LRU}$ replacement. Initially the cache is empty. Conflict misses are those misses which occur due to the contention of multiple blocks for the same cache set. Compulsory ... $10$ times. The number of conflict misses experienced by the cache is _________ .

Consider a $2$-way set associative cache with $256$ blocks and uses $\text{LRU}$ replacement. Initially the cache is empty. Conflict misses are those misses which occur d...

38.6k views

commented Mar 13, 2017

5 answers

13

GATE CSE 2017 Set 1 | Question: 30
Let $u$ and $v$ be two vectors in $\mathbf{R}^{2}$ whose Euclidean norms satisfy $\left \| u \right \| = 2\left \| v \right \|$. What is the value of $\alpha$ such that $w = u + \alpha v$ bisects the angle between $u$ and $v$? $2$ $\frac{1}{2}$ $1$ $\frac{ -1}{2}$

Let $u$ and $v$ be two vectors in $\mathbf{R}^{2}$ whose Euclidean norms satisfy $\left \| u \right \| = 2\left \| v \right \|$. What is the value of $\alpha$ such that $...

14.0k views

commented Mar 3, 2017

6 answers

14

GATE CSE 2017 Set 2 | Question: 29
In a two-level cache system, the access times of $L_1$ and $L_2$ caches are $1$ and $8$ clock cycles, respectively. The miss penalty from the $L_2$ cache to main memory is $18$ clock cycles. The miss rate of $L_1$ cache is twice that of $L_2$. The average ... respectively are $0.111$ and $0.056$ $0.056$ and $0.111$ $0.0892$ and $0.1784$ $0.1784$ and $0.0892$

In a two-level cache system, the access times of $L_1$ and $L_2$ caches are $1$ and $8$ clock cycles, respectively. The miss penalty from the $L_2$ cache to main memory i...

28.6k views

commented Feb 18, 2017

9 answers

15

GATE CSE 2017 Set 1 | Question: 53
Consider the following C program. #include<stdio.h> #include<string.h> void printlength(char *s, char *t) { unsigned int c=0; int len = ((strlen(s) - strlen(t)) > c) ? strlen(s) : strlen(t); printf("%d\n", len); } ... in $string.h$ as returning a value of type $size\_t$, which is an unsigned int. The output of the program is __________ .

Consider the following C program.#include<stdio.h #include<string.h void printlength(char *s, char *t) { unsigned int c=0; int len = ((strlen(s) - strlen(t)) c) ? strlen...

25.0k views

commented Feb 15, 2017

2 answers

16

How To Prepare For Written and Interviews?Major Subjects To Focus and Type of Questions asked.
Which IIT's take admission through written Test and Interviews,Upto what Rank They call and Eg Major Subjects To Focus and Type of Questions asked.

Which IIT's take admission through written Test and Interviews,Upto what Rank They call and Eg Major Subjects To Focus and Type of Questions asked.

13.0k views

commented Feb 14, 2017

11 answers

17

GATE CSE 2014 Set 1 | Question: 47
A function $f(x)$ is continuous in the interval $[0,2]$. It is known that $f(0) = f(2) = -1$ and $f(1) = 1$. Which one of the following statements must be true? There exists a $y$ in the interval $(0,1)$ such that $f(y) = f(y+1)$ For every $y$ ... the function in the interval $(0,2)$ is $1$ There exists a $y$ in the interval $(0,1)$ such that $f(y)$ = $-f(2-y)$

A function $f(x)$ is continuous in the interval $[0,2]$. It is known that $f(0) = f(2) = -1$ and $f(1) = 1$. Which one of the following statements must be true?There exis...

21.0k views

commented Feb 5, 2017

8 answers

18

GATE IT 2005 | Question: 32
An unbiased coin is tossed repeatedly until the outcome of two successive tosses is the same. Assuming that the trials are independent, the expected number of tosses is $3$ $4$ $5$ $6$

An unbiased coin is tossed repeatedly until the outcome of two successive tosses is the same. Assuming that the trials are independent, the expected number of tosses is$3...

33.0k views

answer edited Feb 3, 2017

9 answers

19

GATE CSE 2012 | Question: 38
Let $G$ be a complete undirected graph on $6$ vertices. If vertices of $G$ are labeled, then the number of distinct cycles of length $4$ in $G$ is equal to $15$ $30$ $90$ $360$

Let $G$ be a complete undirected graph on $6$ vertices. If vertices of $G$ are labeled, then the number of distinct cycles of length $4$ in $G$ is equal to$15$$30$$90$$36...

35.0k views

commented Jan 31, 2017

2 answers

20

Suppose the probability that x is the ith element in a list of n distinct integers is i/[n(n + 1)].
Suppose the probability that x is the ith element in a list of n distinct integers is i/[n(n + 1)]. Find the average number of comparisons used by the linear search algorithm to find x or to determine that it is not in the list.

Suppose the probability that x is the ith element in a list of n distinct integers is i/[n(n + 1)]. Find the average number of comparisons used by the linear search algor...

2.3k views

commented Dec 19, 2016

5 answers

21

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)$

3.7k views

commented Nov 4, 2016

2 answers

22

please tell the multiplication of (+15 X -13) Through the Booth Multiplication Algo.
..

..

59.9k views

commented Jun 19, 2016

2 answers

23

Multiplication without '*'
Write a function (proper programming code) for multiplying two integers without using '*' operator and considering all corner cases.

Write a function (proper programming code) for multiplying two integers without using '*' operator and considering all corner cases.

1.3k views

commented Jun 6, 2016

2 answers

24

UGC NET CSE | December 2013 | Part 2 | Question: 20
The correct way to round off a floating number x to an integer value is y = (int) (x + 0.5) y = int (x + 0.5) y = (int) x + 0.5 y = (int) ((int)x + 0.5)

The correct way to round off a floating number x to an integer value isy = (int) (x + 0.5)y = int (x + 0.5)y = (int) x + 0.5y = (int) ((int)x + 0.5)

4.5k views

commented Apr 25, 2016

0 answers

25

GATE 2014 _ 28 [IN]
A scalar valued function is defined as $f(x) = x^T Ax + b^Tx + c$ where A = symmetric +ve definite matrix with diamension n*n x = are vectors of dimension n* 1 The min value of f(x) will occur when x equals (ATA )-1B - (ATA )-1B -(A-1B) / 2 (A-1B) / 2

A scalar valued function is defined as$$f(x) = x^T Ax + b^Tx + c$$where A = symmetric +ve definite matrix with diamension n*n x = are vectors of dimension n* ...

795 views

edited Apr 24, 2016

1 answer

26

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...

2.4k views

commented Apr 19, 2016

0 answers

27

The eigen vectors corresponding to different eigen values of a real symmetric matrix are always orthogonal ?

What is the meaning by this statement - The eigen vectors corresponding to different eigen values of a real symmetric matrix are always orthogonal.Can anyone please expl...

398 views

commented Mar 10, 2016

3 answers

28

GATE2013 EE: GA-2
In the summer of $2012$, in New Delhi, the mean temperature of Monday to Wednesday was $41°C$ and of Tuesday to Thursday was $43°C$. If the temperature on Thursday was $15\%$ higher than that of Monday, then the temperature in $°C$ on Thursday was $40$ $43$ $46$ $49$

In the summer of $2012$, in New Delhi, the mean temperature of Monday to Wednesday was $41°C$ and of Tuesday to Thursday was $43°C$. If the temperature on Thursday was ...

6.9k views

answered Feb 22, 2016

2 answers

29

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

4.5k views

answered Sep 1, 2015

1 answer

30

why row rank of a matrix is equal to column rank of the matrix ?

1.0k views

asked Aug 26, 2015

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true