Rapid Round 1

The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number of nodes in a binary tree of height h is:

• 2^h−1

• 2^h−1−1

• 2^h+1−1

• 2^h+1

Consider a binary min-heap containing 105 distinct elements. Let k be the index (in the underlying array) of the maximum element stored in the heap. The number of possible values of k is

• 53

• 52

• 27

• 1

Consider a hash table with 100 slots. Collisions are resolved using chaining. Assuming simple uniform hashing, what is the probability that the first 3 slots are unfilled after the first 3 insertions?

• (97×97×97)/100^3

• (99×98×97)/100^3

• (97×96×95)/100^3

• (97×96×95/(3!×100^3)

What will be output of this code? #include int main(){ int i = -3; unsigned short u; u = i; printf("%u", u); printf("%d", u); return 0; }

• 65533 -3

• 65533 65533

• -3 -3

• 65533 3

#include struct Ournode{ char x, y, z; }; int main() { struct Ournode p={'1', '0', 'a'+2}; struct Ournode *q=&p; printf("%c, %c", *((char*)q+1), *((char*)q+2)); return 0; } The output of this program is:

• 0, c

• 0, a+2

• '0', 'a+2'

• '0', 'c'

#include int main() { int i= 255; short int *s= (short int *)&i; printf("%d\n", *s); }

• 255,0

• 65280,0

• 0,0

• 0,65280

In which of the following cases is it possible to obtain different results for call-by-reference and call-by-name parameter passing methods?

• Passing a constant value as a parameter

• Passing the address of an array as a parameter

• Passing an array element as a parameter

• Passing an array

#include static char c; static int i; static float f; int main() { printf("%d %d %f ",c,i,f); return 0; } What will be Output ?

• 0 0 0.000000

• 0 0 0

• Compilation Error

• None

Find Output of below Code #include int sum(int n) { n = 3; if (n == 2) return 2; return sum(n-1)*n ; } int main() { printf("%d\n", sum(5) ); return 0 }

• 24

• 120

• 6

• 2

. The equivalent pointer expression by using the array element a[i][j][k][2],

• ((((a+m)+n)+o)+p)

• *(*(*(*(a+i)+j)+k)+2)

• *(((((a+m)+n)+o+p)

• None of the above