Register
Filter

Recent activity by Higgs

0 answers
4
Combinatorics
Why not 2, why 3 , for example if we take { 1,3} from { 1,3,5,7,9} or {2,4} from { 2,4 ,6 ,8} still with two numbers we can get sum as even..Kindly help thanks :)
Why not 2, why 3 , for example if we take { 1,3} from { 1,3,5,7,9} or {2,4} from { 2,4 ,6 ,8} still with two numbers we can get sum as even..Kindly help thanks :)
0 answers
7
Testbook test series
Question statement: In a undirected graph,if we increase weight of each edge by 1 unit ,shortest path remains same (Given:False) Solution says second shortest path may become smaller after increasing the weight. I can't figure out why. Any example or source for this will be helpful..
Question statement: In a undirected graph,if we increase weight of each edge by 1 unit ,shortest path remains same (Given:False)Solution says second shortest path may bec...
0 answers
13
Combinatorics(Bookshelf_Problem)
Consider a bookshelf with $15$ books placed in sequential manner. In how many ways one can choose a set of $5$ books from this shelf so that no $2$ books in this set should be adjacently positioned at the time of picking $?$
Consider a bookshelf with $15$ books placed in sequential manner.In how many ways one can choose a set of $5$ books from this shelf so that no $2$ books in this set shoul...
1 answer
15
SQL query
Found randomly somewhere: i think multiple answers possible?
Found randomly somewhere:i think multiple answers possible?
0 answers
16
GATE2007 clearing ambiguity
https://gateoverflow.in/1269/gate2007-71 there is an ambiguity between the answer personally i feel it should be 11 because one MOV instruction there is not for accesing data but for storing it anybody with any valid reasoning for a chosen answer ....arjun sir please help
https://gateoverflow.in/1269/gate2007-71 there is an ambiguity between the answer personally i feel it should be 11 because one MOV instruction there is not for accesing ...
2 answers
18
ISI2015-MMA-7
Suppose $X$ is distributed as Poisson with mean $λ.$ Then $E(1/(X + 1))$ is $\frac{e^{\lambda }-1}{\lambda }$ $\frac{e^{\lambda }-1}{\lambda +1}$ $\frac{1-e^{-\lambda }}{\lambda}$ $\frac{1-e^{-\lambda }}{\lambda + 1}$
Suppose $X$ is distributed as Poisson with mean $λ.$ Then $E(1/(X + 1))$ is$\frac{e^{\lambda }-1}{\lambda }$$\frac{e^{\lambda }-1}{\lambda +1}$$\frac{1-e^{-\lambda }}{\l...
3 answers
20
GATE IT 2008 | Question: 10
Arrange the following functions in increasing asymptotic order: $n^{1/3}$ $e^n$ $n^{7/4}$ $n \log^9n$ $1.0000001^n$ a, d, c, e, b d, a, c, e, b a, c, d, e, b a, c, d, b, e
Arrange the following functions in increasing asymptotic order:$n^{1/3}$$e^n$$n^{7/4}$$n \log^9n$$1.0000001^n$a, d, c, e, bd, a, c, e, ba, c, d, e, ba, c, d, b, e
9 answers
21
GATE IT 2008 | Question: 44
When $n = 2^{2k}$ for some $k \geqslant 0$, the recurrence relation $T(n) = √(2) T(n/2) + √n$, $T(1) = 1$ evaluates to : $√(n) (\log n + 1)$ $√(n) \log n$ $√(n) \log √(n)$ $n \log √n$
When $n = 2^{2k}$ for some $k \geqslant 0$, the recurrence relation$T(n) = √(2) T(n/2) + √n$, $T(1) = 1$evaluates to :$√(n) (\log n + 1)$$√(n) \log n$$√(n) \log...
1 answer
23
GO-BACK-N problem
6 answers
26
Databases
A Clustered index A) is a dense index always. B) is a sparse index always. C) can be either dense index or a sparse index,but not both. D) can be both dense index and sparse index.
A Clustered indexA) is a dense index always.B) is a sparse index always.C) can be either dense index or a sparse index,but not both.D) can be both dense index and sparse ...
1 answer
27
Based on GATE2005-IT-53
https://gateoverflow.in/3814/gate2005-it-53 i am confused about how the while loop breaks if a=''DBC" and b="BD"? i suppose here both occurence of B and D will have zero count in count arrray when for loop is checked. please explain?
https://gateoverflow.in/3814/gate2005-it-53i am confused about how the while loop breaks if a=''DBC" and b="BD"?i suppose here both occurence of B and D will have zero co...
2 answers
29
coaching
2 answers
30
ROM Size to build the combinational circuit
Specify the size of a ROM (number of words and number of bits per word) that will accommodate the truth table for the following combinational circuit : a code converter from a 4-digit BCD number to a binary number.
Specify the size of a ROM (number of words and number of bits per word) that will accommodate the truth table for the following combinational circuit :a code converter fr...