Wilco Previous Years Solved Sample Placement Papers
-
Choose the correct alternative:
If x = y = 2z and xyz = 256, then what is the value of x?
A. 12
B. 8 Answer: Option B
C. 16
D. 6
-
Choose the correct alternative:
(1/10)18 - (1/10)20 = ?
A. 99/1020 Answer: Option A
B. 99/10
C. 0.9
D. None of these
-
Choose the correct alternative:
Pipe A can fill in 20 minutes, Pipe B in 30 minutes, and Pipe C can empty the same in 40 minutes. If all of them work together, find the time taken to fill the tank.
A. 17 1/7 mins Answer: Option A
B. 20 mins
C. 8 mins
D. None of these
-
Choose the correct alternative:
Thirty men take 20 days to complete a job working 9 hours a day. How many hours a day should 40 men work to complete the job?
A. 8 hrs
B. 7 1/2 hrs Answer: Option B
C. 7 hrs
D. 9 hrs
-
Choose the correct alternative:
Find the smallest number in a GP whose sum is 38 and product is 1728.
A. 12
B. 20
C. 8 Answer: Option C
D. None of these
-
Choose the correct alternative:
A boat travels 20 km upstream in 6 hrs and 18 km downstream in 4 hrs. Find the speed of the boat in still water and the speed of the water current.
A. 1/2 kmph
B. 7/12 kmph Answer: Option B
C. 5 kmph
D. None of these
-
Choose the correct alternative:
A goat is tied to one corner of a square plot of side 12m by a rope 7m long. Find the area it can graze.
A. 38.5 sq.m Answer: Option A
B. 155 sq.m
C. 144 sq.m
D. 19.25 sq.m
-
Choose the correct alternative:
A 270 metres long train running at the speed of 120 kmph crosses another train running in the opposite direction at the speed of 80 kmph in 9 seconds. What is the length of the other train?
A. 230 m Answer: Option A
B. 240 m
C. 260 m
D. 320 m
E. None of these
-
Choose the correct alternative:
What is the output of the following code?
void main() { int i; clrscr(); for(i=1;i<6;++i) switch(i) { case 1: case 2: printf("%d,",i++); break; case 3: continue; case 4: printf("%d,",i); } printf("%d",i); getch(); }Answer: 1,4,6
-
Choose the correct alternative:
Which of the storage class(es) becomes the global variables for the entire program?
A. Extern Answer: Option A
B. Static
C. Auto
D. Register
-
Choose the correct alternative:
What is the output of the program?
void main() { char s[]="oracle is the best"; char t[40]; char *ss,*tt; while(*tt++=*ss++); printf("%s",t); getch(); }A. oracle is the best
B. Core dump Answer: Option B
C. Error Message
D. Goes into infinite loop
-
What is the postfix expression for the following infix expression?
a/b^c-d
a) abc^/d-
b) ab/cd^-
c) ab/^cdd
d) abcd^/-
Answer: a
Explanation: Using the infix to postfix conversion algorithm, the corresponding postfix expression for the infix expression is abc^/d-.
-
What is the corresponding postfix expression for the given infix expression?
a*(b+c)/d
a) ab*+cd/
b) ab+*cd/
c) abc*+/d
d) abc+*d/
Answer: d
-
Given only a single array of size 10 and no other memory is available. Which of the following operations is not feasible to implement (Given only push and pop operation)?
A) Push
B) Pop
C) Enqueue (Ans)
D) Returntop
-
Given an array of size n, let’s assume an element is ‘touched’ if and only if some operation is performed on it (for example, for performing a pop operation the top element is ‘touched’). Now you need to perform Dequeue operation. Each element in the array is touched at least?
A) Once
B) Twice
C) Thrice
D) Four times (Ans)
-
Which of the following is the most widely used external memory data structure?
A) AVL tree
B) B-tree (Ans)
C) Red-black tree
D) Both AVL tree and Red-black tree
-
B-tree of order n is a order-n multiway tree in which each non-root node contains __________
A) at most (n – 1)/2 keys
B) exact (n – 1)/2 keys
C) at least 2n keys
D) at least (n – 1)/2 keys (Ans)
-
A Double-ended queue supports operations such as adding and removing items from both the sides of the queue. You are given only stacks to implement this data structure. How many stacks are required to implement the operation?
A) 1
B) 2 (Ans)
C) 3
D) 4
-
You are asked to perform a queue operation using a stack. Assume the size of the stack is some value ‘n’ and there are ‘m’ number of variables in this stack. What is the time complexity of performing the deQueue operation?
A) O(m) (Ans)
B) O(n)
C) O(m*n)
D) Data is insufficient
-
Consider you have an array of some random size. You need to perform dequeue operation. You can perform it using stack operations (push and pop) or using queue operations itself (enQueue and Dequeue). The output is guaranteed to be the same. Find some differences:
A) They will have different time complexities (Ans)
B) The memory used will not be different
C) There are chances that the output might be different
D) No differences
-
Consider you have a stack whose elements in it are as follows:
5 4 3 2 << top
Where the top element is 2. You need to get the following stack:
6 5 4 3 2 << top
The operations that need to be performed are (You can perform only push and pop):
A) Push(pop()), push(6), push(pop()) (Ans)
B) Push(pop()), push(6)
C) Push(pop()), push(pop()), push(6)
D) Push(6)
-
What will be the output of the program in 16-bit platform (Turbo C under DOS)?
#include
int main() { printf(“%d, %d, %d”, sizeof(3.0f), sizeof(‘3’), sizeof(3.0)); return 0; } A. 8, 1, 4
B. 4, 2, 8
C. 4, 2, 4
D. 10, 3, 4
Ans: B -
Point out the error in the program?
#include
int main() { struct emp { char name[20]; float sal; }; struct emp e[10]; int i; for(i=0; i<=9; i++) scanf(“%s %f”, e[i].name, &e[i].sal); return 0; } A. Error: invalid structure member
B. Error: Floating point formats not linked
C. No error
D. None of above
Ans: B -
What will be the output of the program?
#include
int main() { enum days {MON=-1, TUE, WED=6, THU, FRI, SAT}; printf("%d, %d, %d, %d, %d, %d\n", MON, TUE, WED, THU, FRI, SAT); return 0; } A. -1, 0, 1, 2, 3, 4
B. -1, 2, 6, 3, 4, 5
C. -1, 0, 6, 2, 3, 4
D. -1, 0, 6, 7, 8, 9
Ans: D