Consider a hash table of size 20 in which 15 elements needs to be inserted. Find the number of probes in successful search in the hash table __________. (Upto 3 decimal places)
A d-ary heap is like a binary heap, but non-leaf nodes have 'd' children instead of 2 children. What is the height of a d-ary heap of n elements in terms of n and d?
The symbol # is called as.......
Let A1, A2, A3 and A4 be four matrices of dimensions 10x5, 5x20, 20x10 and 10x5 respectively. The minimum number of multiplications required to find the product A1A2A3A4 is _____.
What is the output of C statement 9.5 % 3?
Apply BFS and DFS on the graph below and find how many nodes are at same position start from node A.
What will be printed by the following loop section?
while (printf ("%d", printf ("mxz") ) )
printf ("ny") ;
Which of the following is true?
Address of ______ variables cannot be accessed.
int a = 5;
cout << "FIRST" << (a<<2) << "SECOND";
int test(int count)
What is sum of all outputs:-
Which of the following recurrence relation will give the total no. of binary search trees possible with n nodes?
What will be the return value of test()?
In the Worst case, in Selection Sort, the total number of moves represented in order of______?
Consider the case of Max heap. If we perform decrease key operation upon a node X. Then tightest upper bound of space complexity for decrease key operation will be
What is the maximum height of an AVL tree with 53 nodes?
Consider the following program fragment
Char c = “HELLO$GRADEUP”;
Char *p = c;
Number of characters printed by above program fragment __.
int main ( )
int Var1=10, Var2=5;
what is the output ?
Consider the following C code snippet:
Assuming i is allocated memory location X. What is the output of the above program?
Finding the minimum element in a max heap can be done in______?