1 votes
203
If 0$<$x$<$1 then(a) $\sqrt{\frac{1-x}{1+x}} < \frac{log(1+x)}{sin^{-1}x} < 1$(b) $\sqrt{\frac{1-x}{1+x}} \frac{log(1+x)}{sin^{-1}x} 1$(c) $\sqrt{\frac{1-x}{1+x}} \fra...
2 votes
204
0 votes
205
0 votes
206
The number of ways in which the numbers 1, 2, 3, 4, 5 can be inserted into binary heap. Such that resulted binary heap is max heap ________.
1 votes
208
Let S={1,2,3} and P(s) is power set of S.A binary operation * is defined by A*B = (A-B) U (B-A). if (P(S),*) is a group then complement of {1} isa){1}b){2}c){3}d){2,3}...
2 votes
209
3 votes
212
There are two sorted list each of length $n$. An element to be searched in the both the lists. The lists are mutually exclusive. The maximum number of comparisons require...
0 votes
213
The associativity of which of the following operators is Left to Right, in C++?Unary OperatorLogical notArray element accessaddressof
2 votes
214
If the equations (λ+1)x + 8y = 4λ and λx + (λ+3)y = 3λ-1 have no solution, then the number of values of λ is :(A) one (B) two (C) three (D) more than three
3 votes
215
0 votes
217
The number of ways we can insert elements { 1, 2, 3, .... 7 } to make an AVL tree, so that it does not have any rotation are _______ ?
2 votes
219
2 votes
220
Suppose A is sorted array and some of the elements are duplicates what is the best upper bound to find out the number of elements that are equal to any given key 'k'.
2 votes
222
Please someone explain ....A directed graph G is acyclic iff depth first search of G yields no back edges
7 votes
223
Q.What will be time complexity of enqueue and dequeue operation when a queue is implemented using two stacks.
0 votes
224
In a min-heap, the next largest element of a particular element can be found in ___ time.A) O(1)B) O(log n)C) O(n)
0 votes
226
Can you see why the output of the following code is 256?main () { int a=0x1ff; char *careful= &a; *careful = 0; printf("%d", a); }
0 votes
228
5 cards are drawn successively with replacement from well shuffled deck of 52 cards.What is the probability thati) all the five cards are spadesii) only 3 cards are spade...