5 answers
3
For a $B^+$ - tree of order $d$ with $n$ leaf nodes, the number of nodes accessed during a search is $O(\_)$.
3 answers
4
Let $p$ and $q$ be propositions. Using only the Truth Table, decide whether $p \Longleftrightarrow q$ does not imply $p \to \lnot q$is True or False.
11 answers
7
In a binary tree, the number of internal nodes of degree $1$ is $5$, and the number of internal nodes of degree $2$ is $10$. The number of leaf nodes in the binary tree i...
3 answers
9
When multiplicand $Y$ is multiplied by multiplier $X = x_{n - 1}x_{n-2} \dots x_0$ using bit-pair recoding in Booth's algorithm, partial products are generated according ...
0 answers
10
0 answers
13
1 answer
14
The minimum size of stack required to evaluate given post fix expression is _____________postfix :- 2 5 x 6 + 4 2 x - MY ANSWER IS 8..CAN ANYONE TELL ME WHERE I AM WRONG�...
4 answers
15
Consider a 2D array with elemnts stored in the form of lower triangular matrix.The elements must be crossed to read A[4,2] from the array [-6..................+8 , -6.......
0 answers
16
Can anyone please explain what is the answer to this question by static and dynamic scoping?
4 answers
18
Draw the state transition of a deterministic finite state automaton which accepts all strings from the alphabet $\{a,b\}$, such that no string has $3$ consecutive occurre...
4 answers
23
Which of the following page replacement algorithms suffers from Belady’s anamoly?Optimal replacementLRUFIFOBoth (A) and (C)
7 answers
27
The running time of the following algorithmProcedure $A(n)$If $n \leqslant 2$ return ($1$) else return $(A( \lceil \sqrt{n} \rceil))$;is best described by$O(n)$$O(\log ...
16 answers
28
0 answers
30
IF A=$\begin{bmatrix} 2& -0.1\\ 0 & 3 \end{bmatrix}$ AND A-1=$\begin{bmatrix} \frac{1}{2}& a\\ 0 & b\end{bmatrix}$ then a+b ?a)$\frac{7}{20}$ b)$\frac{3}...