Register
Filter

Answers by shaktipratap

0 votes
1
#Test_series
The height h of an AVL tree with n nodes lies in the interval: 1. log2(n+1) ≤ h < c log2(n+2)+b 2. log10(n) ≤ h < c log10(n+1)+b 3. log10(n+1) ≤ h < c log10(n+2)+b 4. log2(n) ≤ h < c log2(n+1)+b
The height h of an AVL tree with n nodes lies in the interval:1.log2(n+1) ≤ h < c log2(n+2)+b 2.log10(n) ≤ h < c log10(n+1)+b 3.log10(n+1) ≤ h < c log10(n+2)+b 4.lo...
0 votes
4
Multi Processing OS
In Multi Processing OS Maximum CPU Utilization can be achieved. Maximum throughput is achieved. which of the following is true ? a) 1 only b) 2 only c) both d) none ANS - A) 2 only Please explain it ?
In Multi Processing OSMaximum CPU Utilization can be achieved.Maximum throughput is achieved.which of the following is true ?a) 1 only b) 2 only c) both d) noneANS - A...
3 votes
5
Symbol table Access time
Which of the following symbol table implementations is best suited if access time is to minimum? (a) Linear list (b) Search table (c) Hash table (d) Self-organization list
Which of the following symbol table implementations is best suited if access time is to minimum?(a) Linear list(b) Search table(c) Hash table(d) Self-organization list
0 votes
6
Doubt in Compilers
Which of the following optimization techniques are typically applied on loops? (a) Removal of invariant computation (b) Elimination of induction variables (c) Peephole optimization (d) Constant folding
Which of the following optimization techniques are typically applied on loops?(a) Removal of invariant computation (b) Elimination of induction variables(c) Peephole opti...
0 votes
7
Doubt in compiler
Any transcription error can be repaired by (a) insertion alone (b) deletion alone (c) insertion and deletion alone (d) replacement alone
Any transcription error can be repaired by(a) insertion alone (b) deletion alone(c) insertion and deletion alone (d) replacement alone
0 votes
8
Doubt in Automata
If two finite state machines M and N are isomorphic then M can be transformed to N by relabeling (a) the states alone (b) the edges alone (c) both the states and edges (d) none of the above
If two finite state machines M and N are isomorphic then M can be transformed to N by relabeling(a) the states alone(b) the edges alone(c) both the states and edges(d) no...
1 votes
9
Doubt in Compiler
For which of the following situations, inherited attribute is a natural choice? (a) Evaluation of arithmetic expression (b) Keeping track of variable declaration (c) Checking for the correct use of L-values and R-values (d) All of the above
For which of the following situations, inherited attribute is a natural choice?(a) Evaluation of arithmetic expression(b) Keeping track of variable declaration(c) Checkin...