Easy Tutorial
For Competitive Exams
Placement Papers Wipro Page: 3
42753.A 12 address lines maps to the memory of
1k bytes
0.5k bytes
2k bytes
none
42754.Return addresses will be returned by function to
Pushes to the stack by call
Pushes to the stack by reference
42755.If Jasmine started with 81 dollars, and then saved 3 dollars every day for 5 days, how many dollars did she end up with?
95 dollars
96 dollars
97 dollars
99 dollars
42756.Albert started with 54 marbles and added 4 more every week until he had 74 altogether. How many weeks did that take?
3 weeks
4 weeks
5 weeks
6 weeks
42757.Place 39, 73, 18, 9, 56, 38, 25, 77, 13, 71 in ascending order.
71, 13, 73, 25, 56, 77, 18, 38, 9, 39
9, 13, 18, 25, 38, 39, 56, 71, 73, 77
13, 18, 25, 38, 39, 56, 71, 73, 77, 9
77, 73, 71, 56, 39, 38, 25, 18, 13, 9
42758.Which numbers are in order from smallest to largest?
84, 48, 68, 86, 54, 45
45, 48, 54, 68, 84, 86
48, 45, 54, 68, 86, 84
54, 84, 45, 86, 48, 68
42759.Shona has 9 fewer unread texts than Sarah. Sarah has 16 unread texts. How many unread texts does Shona have?
7
8
9
25
42760.n=7623 { temp=n/10; result=temp*10+ result; n=n/10 }
3268
3267
7623
error
42761.In a compiler there is 36 bit for a word and to store a character 8bits are needed. IN this to store a character two words are appended .Then for storing a K characters string, How many words are needed.
2k/9
2k+8/9
k+8/9
none
42762.C program code int zap(int n) { if(n<=1)then zap=1; else zap=zap(n-3)+zap(n-1); } then the call zap(6) gives the values of zap
8
9
12
15
Share with Friends