3 answers
1
Runtime stack doesnot contain(A) Local variables(B) Static Variables(C) Parameter Passed(D) Return Address
5 answers
4
For a $B^+$ - tree of order $d$ with $n$ leaf nodes, the number of nodes accessed during a search is $O(\_)$.
0 answers
16
f(n)=$2^n$g(n)=n!h(n)=$n^{logn}$ which one is true?A) f(n)=O(g(n)) and g(n)=O(h(n))B) f(n)=$\Omega(g(n)))$ and g(n)=O(h(n))C) g(n)=O(f(n)) and h(n)=O(f(n))D) h(n)=O(f(n))...
1 answer
17
are these equal?R1=(bc*a)*bc*dR2=b(c+ab)*dare r1 and r2 equal? Also can we obtain different regular expressions from a finite automata? if yes, how do we check if they're...
4 answers
20
Given a preorder, postorder and inorder traversal of a tree, is it always possible to obtain a tree that satisfies each of the three conditions? Or is it possible to not ...
2 answers
21
The no. of binary trees with 3 nodes which when traversed by post-order gives the sequenceA, B, C is:(a) 3 (b) 9(c) 7 (d) 5
2 answers
22
Why not Output is showing 90? #include <stdio.h int main() { extern int p; printf("%d ", p); { int p = 90; printf("%d ", p); } }