Skip to main content

WIPRO placement paper 1

WIPRO Placement Paper (Aptitude and Technical) January 2010
Aptitude 15 Questions:
The questions 1-6 are based on the following pattern. The problems below contain a question and
two statements giving certain data. You have to decide whether the data given in the statements
are sufficient for answering the questions.
The correct answer is:
(A) If statement (I) alone is sufficient but statement (II) alone is not sufficient.
(B) If statement (II) alone is sufficient but statement (I) alone is not sufficient.
(C) If both statements together are sufficient but neither of statements alone is sufficient.
(D) If both together are not sufficient.
1. What is John's age?
(I) In 15 years John will be twice as old as Dias would be
(II) Dias was born 5 years ago
Ans. (C)
2. What is the distance from city A to city C in kms?
(I) City A is 90 kms from City B
(II) City B is 30 kms from City C
Ans. (D)
3.Is A=C ? A, B ,C are real numbers
(I) A-B=B-C
(II) A-2C = C-2B
Ans. (C)
4. What is the 30th term of a given sequence ?
(I) The first two terms of the sequence are 1,1/2
(II) The common difference is -1/2
Ans. (A)
5.Was Avinash early, on time or late for work?
(I) He thought his watch was 10 minutes fast
thestudentdaily.com 2010
(II) Actually his watch was 5 minutes slow
Ans. (D)
6. What is the value of A if A is an integer?
(I) A4 = 1
(II) A3 + 1 = 0
Ans. (B)
7. A person travels 12 km in the southward direction and then travels 5km to the right and then
travels 15km toward the right and
finally 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
Ans. (b)
8. X's father's wife's father's granddaughter uncle will be related to X as
(a) Son
(b) Nephew
(c) Uncle
(d) Grandfather
Ans. (c)
9. Find the next number in the series 1, 3 ,7 ,13 ,21 ,31
(a) 43
(b) 33
(c) 41
(d) 45
Ans. (a)
10. 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
thestudentdaily.com 2010
(c) 84629
(d) 82347
Ans. (d)
11. If "PROMPT" is coded as QSPLOS ,then "PLAYER" should be
(a) QMBZFS
(b) QWMFDW
(c) QUREXM
(d) URESTI
Ans. (a)
12. A person travels 6km towards west, then travels 5km towards north ,then finally travels
6km towards west. Where is he with respect to his starting position?
(a) 13km east
(b) 13km northeast
(c) 13km northwest
(d) 13km west
Ans. (c)
13. If A speaks the truth 80% of the times, B speaks the truth 60% of the times. What is the
probability that they tell the
truth at the same time
(a) 0.8
(b) 0.48
(c) 0.6
(d) 0.14
Ans.(b)
14. Susan can type 10 pages in 5 minutes. Mary can type 5 pages in 10 minutes. Working
together, how many pages can
they type in 30 minutes?
A. 15
B. 20
C. 25
D. 65
E. 75
Ans: E
thestudentdaily.com 2010
15. Six bells commence tolling together and toll at intervals 2,4,6,8,10 and 12 seconds
respectively. In 30 minutes how
many times they toll together.
a) 4
b) 10
c) 15
d) 16
Ans: d)
Technical , 20 Questions:
1. 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
Ans. (c)
2. Transponders are used for which of the following purposes
(a) Uplinking
(b) Downlinking
(c) Both (a) and (b)
(d) None of the above
Ans. (c)
3. 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
Ans. (a)
4. A sorting algorithm which can prove to be a best time algorithm in one case
and a worst time algorithm in worst case is
(a) Quick Sort
(b) Heap Sort
thestudentdaily.com 2010
(c) Merge Sort
(d) Insert Sort
Ans. (a)
5. What details should never be found in the top level of a top-down design?
(a) Details
(b) Coding
(c) Decisions
(d) None of the above
Ans. (c)
6. In an absolute loading scheme, which loader function is accomplished by assembler
(a) Reallocation
(b) Allocation
(c) Linking
(d) Both (a) and (b)
Ans. (d)
7. Banker's algorithm for resource allocation deals with
(a) Deadlock prevention
(b) Deadlock avoidance
(c) Deadlock recovery
(d) None of these
Ans. (b)
8. Thrashing can be avoided if
(a) The pages, belonging to the working set of the programs, are in main memory
(b) The speed of CPU is increased
(c) The speed of I/O processor are increased
(d) All of the above
Ans. (a)
9. Which of the following communications lines is best suited to interactive processing
applications?
(a) Narrowband channels
(b) Simplex channels
thestudentdaily.com 2010
(c) Full-duplex channels
(d) Mixed band channels
Ans. (b)
10. A feasibility document should contain all of the following except
(a) Project name
(b) Problem descriptions
(c) Feasible alternative
(d) Data flow diagrams
Ans. (d)
11. What is the main function of a data link content monitor?
(a) To detect problems in protocols
(b) To determine the type of transmission used in a data link
(c) To determine the type of switching used in a data link
(d) To determine the flow of data
Ans. (a)
12. Which of the following is a broadband communications channel?
(a) Coaxial cable
(b) Fiber optic cable
(c) Microwave circuits
(d) All of the above
Ans. (d)
13. Which of the following memories has the shortest access time?
(a) Cache memory
(b) Magnetic bubble memory
(c) Magnetic core memory
(d) RAM
Ans. (a)
14. A shift register can be used for
(a) Parallel to serial conversion
(b) Serial to parallel conversion
(c) Digital delay line
(d) All the above
thestudentdaily.com 2010
Ans. (d)
15. In which of the following page replacement policies, Balady's anomaly occurs?
(a) FIFO
(b) LRU
(c) LFU
(d) NRU
Ans. (a)
16. Subschema can be used to
(a) Create very different, personalised views of the same data
(b) Present information in different formats
(c) Hide sensitive information by omitting fields from the sub-schema's description
(d) All of the above
Ans. (d)
17. A 12 address lines maps to the memory of
a. 1k bytes b. 0.5k bytes c. 2k bytes d. none
Ans: b
18. In a processor these are 120 instructions . Bits needed to implement this instructions
[a] 6 [b] 7 [c] 10 [d] none
Ans: b
19. 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.
[a] 2k/9 [b] (2k+8/9 [c] (k+8/9 [d] 2*(k+8/9 [e] none
Ans: a
20. Virtual memory size depends on
[a] address lines [b] data bus
[c] disc space [d] a & c [e] none
Ans : a

Comments

Popular posts from this blog

Amazon Tree traversal Questions | Amazon interview Questions

The following function is supposed to calculate the maximum depth or height of a Binary tree -- the number of nodes along the longest path from the root node down to the farthest leaf node. int maxDepth( struct node* node) {     if (node==NULL)         return 0;     else     {         /* compute the depth of each subtree */         int lDepth = maxDepth(node->left);         int rDepth = maxDepth(node->right);             /* use the larger one */         if (lDepth > rDepth)             return X;         else return Y;     } } What should be the values of X and ...

TCS placement paper 13

1) Two pipes A and B fill at A certain rate B is filled at 10,20,40,80,. If 1/16 of B if filled in 17 hours what time it will take to get completely filled Ans 21 2) In a shopping mall with a staff of 5 members the average age is 45 years. After 5 years a person joined them and the average age is again 45 years. What’s the age of 6th person? 3) Find (4x+2y)/ (4x-2y) if x/2y=2 4) Find average speed if a man travels at speed of 24kmph up and 36kmph down at an altitude of 200m. Formula is 2xy/(x+y) 5) Same model as 4th question. But it is on flat surface. Formula is same 2xy/(x+y). 6) Six friends go to pizza corner there are 2 types of pizzas. And six different flavors are there they have to select 2 flavors from 6 flavors. In how many ways we can select? Ans: 6C2 7) 3, 15, x, 51, 53,159,161. Find X Ans: 17 8) 3 friends A, B, C went for week end party to McDonald’s restaurant and there they measure there weights in some order IN 7 rounds. A;B;C;A...

Amazon’s most asked interview questions

k largest(or smallest) elements in an array | added Min Heap method Question:  Write an efficient program for printing k largest elements in an array. Elements in array can be in any order. For example, if given array is [1, 23, 12, 9, 30, 2, 50] and you are asked for the largest 3 elements i.e., k = 3 then your program should print 50, 30 and 23. Recommended: Please solve it on “ PRACTICE  ” first, before moving on to the solution. Method 1 (Use Bubble k times) Thanks to Shailendra for suggesting this approach. 1) Modify Bubble Sort to run the outer loop at most k times. 2) Print the last k elements of the array obtained in step 1. Time Complexity: O(nk) Like Bubble sort, other sorting algorithms like Selection Sort can also be modified to get the k largest elements. Method 2 (Use temporary array) K largest elements from arr[0..n-1] 1) Store the first k elements in a temporary array temp[0..k-1]. 2) Find the smallest element in temp[...