Wipro Placement Paper -: Reasoning Questions And Answers

Wipro Previous Years Solved Sample Placement Papers

1. Likelihood
   

   A. liken

   B. likely

   C. like Answer: Option C

   D. likeable

2. With Justine’s nature and passion for art, she would make an excellent tour guide for the museum.
   

   A. volatile

   B. congenial Answer: Option B

   C. servile

   D. fledgling

3. The train had left.
   

   A. past perfect

   B. past continuous

   C. past future

4. A train running at the speed of 60 km/hr crosses a pole in 9 seconds. What is the length of the train?

   (A) 120 metres

   (B) 180 metres

   (C) 324 metres

   (D) 150 metres

   Answer: (A) 120 metres

5. The length of the bridge, which a train 130 metres long and travelling at 45 km/hr can cross in 30 seconds, is:

   (A) 200 m

   (B) 225 m

   (C) 245 m

   (D) 250 m

   Answer: (B) 225 m

6. Present ages of Sameer and Anand are in the ratio of 5 : 4 respectively. Three years hence, the ratio of their ages will become 11 : 9 respectively. What is Anand's present age in years?

   (A) 24

   (B) 27

   (C) 40

   (D) Cannot be determined

   Answer: (B) 27

7. 20/x + 16/x = 12, the value of x =?
   

   a) 33

   b) 3

   c) 6

   d) 13

   Answer: b) 3
8. What is the geometric mean of 2, 4, and 8?
   

   a) 4

   b) 8

   c) 7

   d) 2

   Answer: a) 4

9. Out of the following operators (|, *, +, &, $), the one having the lowest priority is?
   (a) +
   (b) $
   (c) |
   (d) &
   Answer: (c)
   Explanation: Logical OR (|) has the lowest precedence among the given operators, as defined in the infix-to-prefix algorithm.

10. When an operand is read, which of the following is done?

    a) It is placed on to the output

    b) It is placed in operator stack

    c) It is ignored

    d) Operator stack is emptied

    Answer: a

    Explanation: While converting an infix expression to a postfix expression, when an operand is read, it is placed on to the output. When an operator is read, it is placed in the operator stack.

11. What should be done when a left parenthesis ‘(‘ is encountered?

    a) It is ignored

    b) It is placed in the output

    c) It is placed in the operator stack

    d) The contents of the operator stack is emptied

    Answer: c

    Explanation: When a left parenthesis is encountered, it is placed on to the operator stack. When the corresponding right parenthesis is encountered, the stack is popped until the left parenthesis and remove both the parenthesis.

12. What would be the Prefix notation for the given equation? A+(B*C)
    (a) +A*CB
    (b) *B+AC
    (c) +A*BC
    (d) *A+CB
    Answer: (c)
    Explanation: Reverse the equation or scan from right to left. Apply the infix-to-postfix algorithm. Inside the brackets, the result is CB*, and outside the brackets, it is A+. Reversing gives +A*BC.

13. What would be the Prefix notation for the given equation? (A*B)+(C*D)
    (a) +*AB*CD
    (b) *+AB*CD
    (c) **AB+CD
    (d) +*BA*CD
    Answer: (a)
    Explanation: Reverse the equation or scan from right to left. Apply the infix-to-postfix algorithm. Brackets evaluate to DC* and BA*, resulting in +*AB*CD after reversal.

14. What would be the Prefix notation for the given equation? A+B*C^D
    (a) +A*B^CD
    (b) +A^B*CD
    (c) *A+B^CD
    (d) ^A*B+CD
    Answer: (a)
    Explanation: Reverse the equation or scan from right to left. Apply the infix-to-prefix algorithm. The order of precedence is +* and ^. The reversed expression evaluates to +A*B^CD.