Future  Placement Paper   Whole Testpaper   -8 May 2008

Future  Placement Paper   Whole Testpaper   -8 May 2008


  • Posted by  FreshersWorld 
    7 Jan, 2012

    FUTURE SOFT PAPER ON 8th MAY 2008

    Technical Paper

    1.) Output of following C code
    void main()
    {
    int i=4,j=5;
    printf("%f",i/j);
    }
    (a) 0
    (b) 0.8
    (c) 1
    (d) None of these
    Ans-> (d)

    2.) In which of the following postfix notations there is no confusion between unary and binary minus.
    [note:I am not sure about the choices]
    (a) a*b--
    (b) a--bc

    3.) Output of folowing C code
    void main()
    {
    int i=0,j=0;
    int arr[4][4] = {1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16};
    clrscr();
    for (i=2;i>=0;i--)
    for (j=2;j>=0;j--)
    printf ("%d ", *(*(arr+j)+i));
    getch();
    }
    (a)11 10 9 7 6 5 3 2 1
    (b)11 7 3 10 6 2 9 5 1
    (c)........
    (d)None of these
    Ans-> (b)

    4.) If there is 4 jobs(j1,j2,j3,j4) and there deadlines (2,4,2,4).Which of the followinf sheduling is not possible.
    (a)j1 j3 j2 j4
    (b)j1 j2 j4 j3
    (c)j1 j3 j4 j2
    (d)j3 j1 j2 j4

    5.) .4 process allocated 8000 bytes of memory according to best fit as follows:-
    p1 - 2000
    p2 - 2000
    p3 - 2500
    p4 - 1500
    p1 and p4 is released.If a process p with 1000 bytes enter where will it be paced
    (a) After p1
    (b) After p3
    (c) Cannot be placed
    (d).......
    Ans->(b)

    6.) Heap with 10 bytes is present.Then which of the following series is possible 4 options of a series of malloc and free funtions.Don't remeber the choices but easy to get the answer.

    7.).All combinational circuits can be implemented by
    (a) Only NOR
    (b) Only NAND
    (c) Only XOR
    (d) None of these
    Ans-> (d)

    8.) void main()
    { int a=10,b=11;
    printf ("%d",a+++b);
    printf ("%d",a+++b);
    }
    (a.) 22,23
    (b.) 23,24
    (c.) 21,22
    (d.) none
    Ans->(c)

    They themselves had said to us after their powerpoint presentation that they gonna repeat the questions, so check this up......

    More Questions : 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 - ? 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
    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

2009-2016 downloadmela.com. All rights reserved.