Answers by Purple / GATE Overflow for GATE CSE

0 votes

1

Probability puzzles
A grasshopper is sitting on a little stone, which we'll call stone zero. Ahead of him, arranged in a line, are stones one, two, three, et cetera, all the way up to nine. The grasshopper would like to reach that ninth stone, for reasons ... two: he could take one big jump, or two little ones. How many different paths can the grasshopper take to reach his destination?

A grasshopper is sitting on a little stone, which we'll call stone zero. Ahead of him, arranged in a line, are stones one, two, three, et cetera, all the way up to nine. ...

1.3k views

answered May 23, 2017

0 votes

2

GB Mock 2

950 views

answered Feb 7, 2017

4 votes

3

Virtual Gate Test Series: Databases - Referential Integrity
We can convert any weak entity set to a strong entity set by simply adding appropriate attributes. Why, then, do we have weak entity sets at all? $1)$ We want to avoid the data duplication and consequent possible inconsistencies caused by duplicating the key of the strong ... : $A)1$ and $2$ $B)2$ and $3$ $C)1$ and $3$ $D)1,2$ and $3$

We can convert any weak entity set to a strong entity set by simply adding appropriate attributes. Why, then, do we have weak entity sets at all? $1)$ We want to avoid th...

4.8k views

answered Jan 19, 2017

0 votes

4

GATE 2017
Are p-np problems in the syllabus for GATE 2017 ?

Are p-np problems in the syllabus for GATE 2017 ?

509 views

answered Jan 11, 2017

2 votes

5

Programming

496 views

answered Jan 10, 2017

0 votes

6

admission in vjti
minimum rank required to get into vjti mumbai for general category

minimum rank required to get into vjti mumbai for general category

478 views

answered Feb 26, 2016

0 votes

7

serializability
any one reply pls fast

any one reply pls fast

524 views

answered Feb 5, 2016

0 votes

8

Probability
The probability of event A occurring is 0.5 and of B occurring is 0.3. If A and B are mutually exclusive events then the probability of neither A nor B occurring is___ Solution : 0.2 P(A' UNION B' ) = 1- P(A UNION B) 1-0.8 = 0.2 My Solution : ... ' using demorgans law = 1- P ( A INTERSECTION B ) = 1 - 0 ( mutually exclusive ) =1 Which is the correct approach . Please Help

The probability of event A occurring is 0.5 and of B occurring is 0.3. If A and B are mutually exclusive events then the probability of neither A nor B occurring is___Sol...

772 views

answered Feb 5, 2016

3 votes

9

aptitude
Four undergraduates are staying is a room. They agreed that older enjoys the more space. Manu is two months older than Sravan, who is one month younger than Trideep. Pavan is one month older than Sravan. Who will enjoy more space in room? (A) Manu (B) Sravan (C) Trideep (D) Pavan

Four undergraduates are staying is a room. They agreed that older enjoys the more space. Manu is two months older than Sravan, who is one month younger than Trideep. Pava...

418 views

answered Feb 4, 2016

1 votes

10

Is the function differentiable at x=1
The question is f(x) = | x-1 | + | x+1 | is differentiable at x=1 or not . Now , when x<1 , the first part becomes : -(x-1) , i.e 1-x and why should we not change the sign of second part ,i.e (x+1) ?

The question is f(x) = | x-1 | + | x+1 | is differentiable at x=1 or not . Now , when x<1 , the first part becomes : -(x-1) , i.e 1-x and why should we not change the sig...

528 views

answered Jan 30, 2016

1 votes

11

PLz solve this
Let a2 = b+c b2 = a+c c2 =a+ b then find the value of (1/1+a)+(1/1+b)+(1/1+c) = ??

Let a2 = b+c b2 = a+c c2 =a+ b then find the value of (1/1+a)+(1/1+b)+(1/1+c) = ??

247 views

answered Jan 29, 2016

27 votes

12

Formula for calculating efficiency of ethernet
What formula to use for calculating efficiency of ethernet is it $\frac{1}{1+6.44a}$ or $\frac{1}{1+5.44a}$ or $\frac{1}{1+5a}$ I saw three versions for calculating the same thing in different places. I want to know which one is correct.

What formula to use for calculating efficiency of ethernet is it $\frac{1}{1+6.44a}$ or $\frac{1}{1+5.44a}$ or $\frac{1}{1+5a}$I saw three versions for calculating...

16.6k views

answered Jan 29, 2016

11 votes

13

GATE CSE 2003 | Question: 62
In a permutation $a_1\ldots a_n$, of $n$ distinct integers, an inversion is a pair $(a_i, a_j)$ such that $i < j$ and $a_i > a_j.$ What would be the worst case time complexity of the Insertion Sort algorithm, if the inputs are restricted to permutations of $1. . . n$ with at most $n$ inversions? $\Theta(n^2)$ $\Theta(n\log n)$ $\Theta(n^{1.5})$ $\Theta(n)$

In a permutation $a_1\ldots a_n$, of $n$ distinct integers, an inversion is a pair $(a_i, a_j)$ such that $i < j$ and $a_i a_j.$What would be the worst case time complex...

19.9k views

answered Jan 27, 2016

22 votes

14

ISRO2015-38
Suppose two jobs, each of which needs $10$ minutes of CPU time, start simultaneously. Assume $50\%$ I/O wait time. How long will it take for both to complete, if they run sequentially? 10 20 30 40

Suppose two jobs, each of which needs $10$ minutes of CPU time, start simultaneously. Assume $50\%$ I/O wait time. How long will it take for both to complete, if they run...

11.3k views

answered Jan 27, 2016

0 votes

15

GEEK_MOCK_QUETION_30
$\begin{pmatrix} 4&3 \\ 6&3 \end{pmatrix}$ What is the sum of all the elements of the $L$ and $U$ matrices as obtained in the L U decomposition? $16$ $10$ $9$ $6$

$\begin{pmatrix}4&3 \\6&3 \end{pmatrix}$What is the sum of all the elements of the $L$ and $U$ matrices as obtained in the L U decomposition?$16$$10$$9$$6$

1.3k views

answered Jan 26, 2016

6 votes

16

Time & Space Complexity
Consider the following pseudo code written in C style: bool fun(int arr[],int n,int X) { if(X == 0) return true; if(n == 0 && X !=0) return false; if(arr[n-1]*arr[n-1] > X) return fun(arr, n-1, X); return fun(arr,n-1,X) || ... Time complexity of fun() is O(n2) and it requires O(n) extra space (d) Time complexity of fun() is O(n2) and it requires O(n2) extra space

Consider the following pseudo code written in C style:bool fun(int arr[],int n,int X) { if(X == 0) return true; if(n == 0 && X !=0) return false; if(arr[n-1]*arr[n-1] X)...

914 views

answered Jan 26, 2016

1 votes

17

how many NAND gate required for AC+BD+AB

337 views

answered Jan 23, 2016

19 votes

18

GATE CSE 1991 | Question: 03-viii
Consider the following Pascal function: Function X(M:integer):integer; Var i:integer; Begin i := 0; while i*i < M do i:= i+1 X := i end The function call $X(N)$, if $N$ is positive, will return $\lfloor\sqrt N \rfloor$ $\lfloor\sqrt N \rfloor +1$ $\lceil \sqrt N \rceil$ $\lceil \sqrt N \rceil +1$ None of the above

Consider the following Pascal function:Function X(M:integer):integer; Var i:integer; Begin i := 0; while i*i < M do i:= i+1 X := i endThe function call $X(N)$, if $N$ is ...

3.6k views

answered Jan 23, 2016

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