Register
Filter

Answers by Arjun

1 votes
2011
floating point range
Plz xplain
Plz xplain
55 votes
2013
GATE CSE 2012 | Question: 21
Consider a random variable $X$ that takes values $+1$ and $−1$ with probability $0.5$ each. The values of the cumulative distribution function $F(x)$ at $x = −1$ and $+1$ are $0$ and $0.5$ $0$ and $1$ $0.5$ and $1$ $0.25$ and $0.75$
Consider a random variable $X$ that takes values $+1$ and $−1$ with probability $0.5$ each. The values of the cumulative distribution function $F(x)$ at $x = −1$ and ...
85 votes
2014
GATE CSE 2004 | Question: 29
The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is of the order of $n$ $n^2$ $n \log n$ $n \log^2n$
The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is of the order of$n$$n^2$$n \log n$$n \log^2n$
30 votes
2015
GATE CSE 1999 | Question: 1.12
A sorting technique is called stable if it takes $O (n \log n)$ time it maintains the relative order of occurrence of non-distinct elements it uses divide and conquer paradigm it takes $O(n)$ space
A sorting technique is called stable ifit takes $O (n \log n)$ timeit maintains the relative order of occurrence of non-distinct elementsit uses divide and conquer paradi...
89 votes
2016
GATE CSE 1999 | Question: 1.13
Suppose we want to arrange the $n$ numbers stored in any array such that all negative values occur before all positive ones. Minimum number of exchanges required in the worst case is $n-1$ $n$ $n+1$ None of the above
Suppose we want to arrange the $n$ numbers stored in any array such that all negative values occur before all positive ones. Minimum number of exchanges required in the w...
134 votes
2017
GATE CSE 2010 | Question: 27
What is the probability that divisor of $10^{99}$ is a multiple of $10^{96}$? $\left(\dfrac{1}{625}\right)$ $\left(\dfrac{4}{625}\right)$ $\left(\dfrac{12}{625}\right)$ $\left(\dfrac{16}{625}\right)$
What is the probability that divisor of $10^{99}$ is a multiple of $10^{96}$?$\left(\dfrac{1}{625}\right)$$\left(\dfrac{4}{625}\right)$$\left(\dfrac{12}{625}\right)$$\lef...
21 votes
2019
GATE CSE 2005 | Question: 17
The hexadecimal representation of (657)8 is: $\text{1AF}$ $\text{D78}$ $\text{D71}$ $\text{32F}$
The hexadecimal representation of (657)8 is:$\text{1AF}$$\text{D78}$$\text{D71}$$\text{32F}$
38 votes
2021
GATE CSE 2005 | Question: 66
Match each of the high level language statements given on the left hand side with the most natural addressing mode from those listed on the right hand side. ... $(1, b), (2, c), (3, a)$ $(1, a), (2, b), (3, c)$
Match each of the high level language statements given on the left hand side with the most natural addressing mode from those listed on the right hand side.$$\begin{array...
21 votes
2029
Clock-frequency
Many microprocessors have a specified lower limit on clock frequency (apart from the maximum clock frequency limit) because ?
Many microprocessors have a specified lower limit on clock frequency (apart from the maximum clock frequency limit) because ?
5 votes
2031
What is the time complexity ?
What is the time complexity? main() { n=2^2^k, k>0 for(i = 1 to n) { j=2 while(j ≤ n) { j=j^2 } } }
What is the time complexity?main() { n=2^2^k, k>0 for(i = 1 to n) { j=2 while(j ≤ n) { j=j^2 } } }
11 votes
2036
What is the time complexity?
double foo(int n) { int i; double sum; if(n == 0) { return 1.0; } else { sum = 0.0; for(i = 0; i < n; i++) { sum += foo(i); } return sum; } } The time complexity of the above code is?
double foo(int n) { int i; double sum; if(n == 0) { return 1.0; } else { sum = 0.0; for(i = 0; i < n; i++) { sum += foo(i); } return sum; } }The time complexity of the ab...
3 votes
2037
Why not d?
Why not option d is correct ?
Why not option d is correct ?
Page: