Skip to main content

infosys paper-3

A company produces maruti 800 and maruti zen. There are 3 spray painters, two car makers and 1 quality checker. They work 10 hours a day. It takes 25 mins to spray paint, 15 mins to make car and 20 mins quality check of maruti 800 by a single person and 30, 15, 45 mins for maruti zen respectively

1) What is the maximum number of maruti 800 that can be built in 24 hours?
2) What is the maximum number of maruti zen that can be built in 24 hours?
Each problem consists of a problem followed by two statements. Decide whether the data in the statements are sufficient to answer the question. Select your answer according to whether:

(A) Any one statement alone is sufficient to answer
(B) both statements taken together are sufficient to answer the question, but neither statement alone is sufficient
(c) each statement alone is sufficient
(D) statements 1 and 2 together are not sufficient, and additional data is needed to answer the question

1) What is the value of (a+c):c
Statement 1 a:b=2:3
Statement 2 b:c=4:5
2) What is the average of 10 students?
Statement 1 The average age of six youngest students is 10 years.
Statement 2 The average age of four youngest students is 5 years.
3) The distance travelled varies directly as the square of the time taken. What is the distance travelled in 10th second?
Statement 1 Distance travelled in 5 seconds is 124 m
Statement 2 Distance travelled in 10 seconds is 567 m.
4) What is the total amount deposited in 5 accounts?
Statement 1 The average deposit of 5 accounts is Rs 500.
Statement 2 The highest and lowest amount of money in an account is 100 and 200.
5) A vessel is 50% full and another is 60% full. Which vessel has a larger capacity.
Statement 1 Vessel A gets empty to make 5/6 of vessel B full.
Statement 2 50% of water from vessel A accounts for 2/3 of vessel B.



AT LAST I CAN SAY THAT CONCENTRATE ON LOGICAL REASONING

Labels:

Comments

Post a Comment

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 ...
Post a Comment
Read more

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...
Post a Comment
Read more

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[...
Post a Comment
Read more