FutureSoft1 - related Qn. 16. parameter passing (35,20) 17....

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Sheet1 Page 1 Future soft The Questions are follows 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)) - ans: none of the above 5. Boolean expn Evalvate 6. Common subexpn : - 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) clarify this with sans 12. allocation ans: (ii) only 13. swapping : ans: reference only 14. Compiler - related Qn. 15. LAN frames - ?
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: related Qn. 16. parameter passing (35,20) 17. sliding window protocol- BUFFER SIZE large 18. kernel mode - deallocate resource 19. logic circuit ans . Minimum OR = 3 Sheet1 Page 2 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 possi = 2 23. 2 bits flip / 2 bits exchange ans : the word with one '1' 24. any addr K^+ v(a) + 2I - 2a You try to prepare all subject questions in all the papers being sent so that it will be useful in the interview. concentrate on OS, networks....
View Full Document

This note was uploaded on 06/27/2010 for the course MACS MCA taught by Professor Brs during the Spring '10 term at National Institute of Technology, Calicut.

Page1 / 2

FutureSoft1 - related Qn. 16. parameter passing (35,20) 17....

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online