# #ME Test series

0 votes
140 views

retagged
0
Is 136?
0
If taking termination condition i>=1 : Solution : 59?

First time : find(6,5) : retruned value : 35

Second time : find(5,4) : retruned value : 24
0
when first time we hit the for loop

then how you calculated value of i please tell me ? how to find the size of (*arr)?
1

148 answer

0
sorry for poor image

but just take the concept and analyze the sequence that's all
0

@Magma....thanks!

## Related questions

1 vote
0 answers
1
442 views
Consider an empty binary search tree of height $-1.$We need to fill the following sequence of numbers in it $: 11, 12, 13, 14, 15, 16, 17.$The number of ways in which the numbers can be inserted in an empty binary search tree, such that the resulting tree has height $6,$ is _____________ $A)2$ $B)4$ $C)32$ $D)64$
0 votes
0 answers
2
76 views
#include<stdio.h> int main() { char A[5][7][6]; char *p[5][7][6]; printf("%d\t", (unsigned)(A+1)-(unsigned)A); printf("%d", (unsigned)(p+1)-(unsigned)p); } 42 42 1 1 42 336 336 42
0 votes
1 answer
3
261 views
0 votes
1 answer
4
115 views