Placement Papers: Future Soft 2009 Paper

Download PDF of This Page (Size: 173K)

Examrace Placement Series prepares you for the toughest placement exams to top companies.

  1. Some palindrome question. The answer was (c)

  2. Capacity of line… Ans was 900

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

  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. S → AB | AS A → a | aA B → b

  12. What is the grammer accepted by the above? Ans. Aa * b

  13. allocation ans 2 only

  14. swapping: Ans reference only

  15. Compiler-related Qn.

  16. LAN frames-? related Qn.

  17. parameter passing (35, 20)

  18. sliding window protocol

    • BUFFER SIZE large

  19. kernel mode-deallocate resource

  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

  25. S → AB | AS A → a | aA B → b What is the grammer accepted by the above? Ans. Aa * b How many address lines are needed to address a 64Kb segment with each register storing upto 512 bytes. Ans. 14 address lines Form the POS form of the expression given below _ _ _ X. Y. Z + X. Y. Z + X (Y + Z).

  26. In a computer system the ROM:

    1. contains boot software

    2. is permanent

    3. Both of the above

    4. None of the above

    Ans (c).

  27. Find the output for the following C program int array[4][4] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16}; for (i = 2; i<0; i--) for (j = 2; j ⇐ 0; j--) printf ( “%d” arr[i][j])

  28. Find the output for the following C program #include <stdio. h> void main () { int i, x, sum = 0; int arr[6] = [1, 2, 3, 4, 5, 6] for (i = 0; i<4; i + + ) sum + = func (arr[i]); printf ( “%d” sum); } func (int x) { int val, x; val = 2; return (x + val + + ); }

  29. Given a string STOCK and a stack of size 4. Which of the following strings cannot be generated using this stack.

    1. TSOCK

    2. TOSKC

    3. STOCK

    4. TKOSC

    5. None of these

  30. What range of integral values can be stored using 32 bits?

  31. If a layer 4 transfers data at the rate of 3000 bytes/sec. What will be the size of data block transferred by Layer 2

  32. If there are n nodes and K edges in a graph then what is the order of traversing Ans. O (n2)

  33. A graph is represented as an adjacency list with n vertices and e edges

  34. e = <e + e> | <e * e> | < (e) > | <id>

  35. What forms do the expressions created by the above definition fit in Ans. All arithematic expressions

  36. The s/n id 3 dB Find the capacity of the line.