8 answers
4
In a complete $k$-ary tree, every internal node has exactly $k$ children. The number of leaves in such a tree with $n$ internal node is:$nk$$(n-1)k + 1$$n(k-1) +1$$n(k-1)...
3 answers
6
$P$ is a $16$-bit signed integer. The $2$'s complement representation of $P$ is $(F87B)_{16}$. The $2$'s complement representation of $8\times P$ is$(C3D8)_{16}$$(187B)_{...
0 answers
11
What will be the final output : #include <stdio.h int r(){ static int num=7; return num ; } int main(){ for(r();r();r()) { printf("%d ",r()); } return 0; } A)63 B)41 C)52...
1 answer
13
4 answers
14
What is the difference between order and degree of a B-tree are they same or different
2 answers
15
1 answer
20
how to find L1/L2 for some L1 and L2 (is diagram making must )how to conclude that L1 is divisible or not divisible by L2