# Wipro Question With Answers

Here are some of the Wipro question with answers!

1. A person travels 12 km in the southward direction and then travels 5km to the right and then travels 15km toward the right andfinally travels 5km towards the east, how far is he from his starting place?

(a) 5.5 kms

(b) 3 km

(c) 13 km

(d) 6.4 km

2. X’s father’s wife’s father’s granddaughter uncle will be related to X as

(a) Son

(b) Nephew

(c) Uncle

(d) Grandfather

3. Find the next number in the series 1, 3 ,7 ,13 ,21 ,31

(a) 43

(b) 33

(c) 41

(d) 45

4. If in a certain code “RANGE” is coded as 12345 and “RANDOM” is coded as 123678. Then the code for the word”MANGO” would be

(a) 82357

(b) 89343

(c) 84629

(d) 82347

5. If “PROMPT” is coded as QSPLOS ,then “PLAYER” should be

(a) QMBZFS

(b) QWMFDW

(c) QUREXM

(d) URESTI

6. Susan can type 10 pages in 5 minutes. Mary can type 5 pages in 10 minutes. Working together, how many pages canthey type in 30 minutes?

(a). 15

(b). 20

(c).25

(d). 65

(e). 75

7. If the time quantum is too large, Round Robin scheduling degenerates to

(a) Shortest Job First Scheduling

(b) Multilevel Queue Scheduling

(c) FCFS

(d) None of the above

8. Transponders are used for which of the following purposes

(a) Uplinking

(b) Downlinking

(c) Both (a) and (b)

(d) None of the above

9. The format specifier “-%d” is used for which purpose in C

(a) Left justifying a string

(b) Right justifying a string

(c) Removing a string from the console

(d) Used for the scope specification of a char[] variable

10. A sorting algorithm which can prove to be a best time algorithm in one caseand a worst time algorithm in worst case is

(a) Quick Sort

(b) Heap Sort

(c) Merge Sort

(d) Insert Sort

*Answers*

1. (b) 3 km

2. (c) Uncle

3. (a) 43

4. (d) 82347

5. (a) QMBZFS

6. (e) 75

7. (c) FCFS

8. (c) Both (a) and (b)

9. (a) Left justifying a string

10. (a) Quick Sort

I hope its useful to you!! share your comments below 🙂