Register
Filter

Recent activity by Vertika Srivastava

2 answers
1
RAW hazard
0 answers
4
No of positive integer satisfying the inequality
e Q) The number of positive integers satisfying the inequality are ________ $^{n+1}C_{(n-2)} + ^{n+1}C_{(n-1)}\leq 90$ getting n= 1 to 9 so answer should be 9 but answer given is 8 (2 to 9)
eQ) The number of positive integers satisfying the inequality are ________ $^{n+1}C_{(n-2)} + ^{n+1}C_{(n-1)}\leq 90$getting n= 1 to 9 so answer should be 9 ...
3 answers
7
GATE CSE 1994 | Question: 5
A $3-\text{ary}$ tree is a tree in which every internal node has exactly three children. Use induction to prove that the number of leaves in a $3-\text{ary}$ tree with $n$ internal nodes is $2(n+1)$.
A $3-\text{ary}$ tree is a tree in which every internal node has exactly three children. Use induction to prove that the number of leaves in a $3-\text{ary}$ tree with $n...
11 answers
9
GATE IT 2007 | Question: 28
Consider a hash function that distributes keys uniformly. The hash table size is $20$. After hashing of how many keys will the probability that any new key hashed collides with an existing one exceed $0.5$. $5$ $6$ $7$ $10$
Consider a hash function that distributes keys uniformly. The hash table size is $20$. After hashing of how many keys will the probability that any new key hashed collide...
2 answers
11
efficiency
3 answers
13
TIFR CSE 2012 | Part B | Question: 14
Consider the quick sort algorithm on a set of $n$ ... $\Theta (n^{2})$. None of the above.
Consider the quick sort algorithm on a set of $n$ numbers, where in every recursive subroutine of the algorithm, the algorithm chooses the median of that set as the pivot...
5 answers
20
GATE CSE 1994 | Question: 14b
For a $B^+$ - tree of order $d$ with $n$ leaf nodes, the number of nodes accessed during a search is $O(\_)$.
For a $B^+$ - tree of order $d$ with $n$ leaf nodes, the number of nodes accessed during a search is $O(\_)$.