WIPRO  Placement Paper   Aptitude -Reasoning   -26 Feb 2005

WIPRO  Placement Paper   Aptitude -Reasoning   -26 Feb 2005


  • Posted by  FreshersWorld 
    7 Jan, 2012

     ample Questions

    1. A topic on Gandhiji's Salt Satyagrah Movement Four sentences were given and you have to arrange them
          to make a paragraph.
          Ans. CABD (Check it out).


    2. What can't be changed by the user program (Four choices were there).
           Ans. Memory Map (Check it out).

    3. In which layer ROUTING is performed ?
          Ans. Network Layer 

    4. What is the output of the following code snippet
          main()
           {
             printf(5+"Fascimile");
           }
          Ans. mile

    5. What is the output
           Int count=10,sum=0,*temp;
           Temp=&count;
           Sum=? &count;( It was actually given temp=? &count;
           which is probably wrong)
           printf("sum=%d count= %d temp=%d ",sum,count,*temp);
           Ans. C (most expected answer ,check it)

    6. Which one has no L-Value 
          [i] a[i]
          [ii] i
          [iii] 2 [iv] *(a+i) Ans . [iii]

    7. In threaded binary for which traversal orders unused left and right links are used?

    8. Which is false for binary tree?
            [i] Any node should have two children.
            [ii] 
            [iii] At fourth level the number of node should be less than 16.

    9. Which is true for binary search ?
            [i] Traversal scheme
            [ii]
            [iii]Greedy algorithm
            [iv] Divide and conquer algorithm
            Ans. [iv]

    10.  What is the protocol used for getting the physical address by supplying IP address of a node ?
           [i] ARP
           [ii] RARP
           [iii] BOOTP
           [iv] DHCP Ans. [i]

    11.  If DELHI is coded as CCIDD then how BOMBAY will be coded?

    12. Opposite meaning of SPUR.

    13. Opposite of HARBINGER .
              Ans. Follower

    14. Opposite meaning of PROTRUSION.

    15. Opposite meaning of RESTIVENESS. 
            Ans.Docility.

    16. Find the odd one in a given analogy Ans. Mundane.

    17. Find the analogy : SURPRISE : EXCLAMATION 
             Ans.  Dismay:groan.

    18. Find the analogy : Plateau : Taxonomy.

    19. Question from congestion control topic: 
               Ans: source quench.

    20. Question from kernel mode: 
             Ans:Disable Interrupts.

    21.  which one is a page replacement algorithim.
             [i]fifo
             [ii]
             [iii]Least recently used.
             [iv]All of above.

    22. Using two numbers And interchanging + and * there was a question.
            Ans:  (iii)(some expression=22).

    23. For each hour an watch is going slow by 30 seconds.Now time is  8a.m.What will be the actual time at 8p.m.
             Ans:ii)7:54.

    24. Question regarding while loop. Ans:(iii).

    25. Alphabetical order L,M,?(cant remember)   Ans:F.

    26. One puzzle:(I cant exactly remember this question giving brief idea of this question)there were four guys A,B,C,D. the older
            and younger  relation is given . U have to find the age of the A 
             Ans: 7 years(check it out).

    27. Fallacy question: six sentences are given.
           [i]?
           [ii]?
           [iii]?
           [iv]? Ans: [i].

    28. Nine people six floor. Conditions are given.(This was a very long paragraph).Peoples named like I,J,K,L,M,N,O,P,Q.
             Ans:i)J.

    29. A question regarding node. 

    30. A problem regarding age of father and son(very easy problem u can solve it).

    31. A problem regarding age of father and son(very easy problem u can solve it).

    32. Point out error in the follwing sentence:I got the book in the office and slipped it out.
           [i]I got the book.
           [ii] in the.
           [iii]office and . 
           [iv] slipped it out.
           Ans:[iv].

    33. Point out error:(about a flowers garden)
              ans:(I can't remember the options).answer will be "among on another".

2009-2016 downloadmela.com. All rights reserved.