3 answers
3
In a $\mathrm{B}+$ tree, the requirement of at least half-full $(50 \%)$ node occupancy is relaxed for which one of the following cases?Only the root nodeAll leaf nodesAl...
5 answers
6
For positive non-zero real variables $x$ and $y$, if\[\ln \left(\frac{x+y}{2}\right)=\frac{1}{2}[\ln (x)+\ln (y)]\]then, the value of $\frac{x}{y}+\frac{y}{x}$ is$1$$1 / ...
1 answer
12
Which does this sentence mean?In BFS of an undirected graph, there are no back edge and no forward edge.
3 answers
15
A Boolean Function must satisfy the condition f(a,b,c) = f(c,b,a). how many such functions are possible?
1 answer
16
Question :Consider a system with 20 bit physical address and direct mapped cache with 64 blocks and block size of 16 bytes To what block number does byte address 1200 map...
2 answers
22
Match List I with List II :List IList II(A) Type $0$(I) Finite automata(B) Type $1$(II) Tuning machine(C) Type $2$(III) Linear bound automata(D) Type $3$(IV) Pushdown aut...
1 answer
23
Match List I with List II :$\begin{array}{ll} \text{List I} & \text{List II} \\ \\\text { (A) Least frequently used } & \text { (I) Memory is distributed among processors...
3 answers
29
If job $J=(J_{1},J_{2},J_{3},J_{4})$ are given their processing time $T_{i}=(1,1,2,3)$ and deadline are $D_{i}=(3,4,2,3)$ maximum how many job can be done$?$$A)1$ ...