1. Number of null pointers in any binary tree = n+1.

2. max(t1,t2,...tn) = pipelining.

3. 50% -DBETXXXXXX - density.

4. print (Head(T)) Traverse(left(T)) print (Head(T)) Traverse(right(T))

5. Boolean Expression Evalvate.

6. Common sub expression:-

Ans: a + e

7. LRU : 1, 2, 3. 8. Tr. Delay - 10000 bits

Ans. 10.01

9. Grammar of Number of shift / reduce operator:

Ans. 4.

10. CPU scheduling 9,8 ?

11. If even x/2 else p(p(3x+1)) 2^k + 1: 3 . 2^(k-1)

12. Memory Allocation Related.

13. Swapping.

Ans: Reference only.

14. Compiler - related Qn.

15. LAN frames - related question.

16. Parameter passing (35,20).

17. sliding window protocol - BUFFER SIZE large.

18. kernel mode - deal locate resource.

19. logic circuit

Ans: Minimum OR = 3.

20. Combinatorics related.

21. Priority Scheduling.

22. cobegin begin x = y; x= x+1; y= x begin x =y; z= z+1; y= z coend ans. Number of values possible = 2.

23. 2 bits flip / 2 bits exchange.

24. Any addr K^+ v(a) + 2I - 2a.