Skip to main content

TCS placement paper 21

1. Out of 7 children the youngest is boy then find the probability that all the remaining children are boys

a) 1/64 b) 1/32 c) 1/128 d) 1/256

ans:probability=(1/2)^6=1/64

2. On planet korba, a solar blast has melted the ice caps on its equator. 9 years after the ice melts, tiny planetoids called echina start growing on the rocks. Echina grows in the form of circle, and the relationship between the diameter of this circle and the age of echina is given by the formula d = 4*√ (t-9) for t ≥ 9 where d represents the diameter in mm and t the number of years since the solar blast.Jagan recorded the radius of some echina at a particular spot as 7mm. How many years back did the solar blast occur?

a) 17 b) 21.25 c) 12.25 d) 14.05

ans:put d=7 in given equation and square both side and then find the value of t.

3.Ferrari S.P.A is an Italian sports car manufacturer based in Maranello, Italy. Founded by Enzo Ferrari in 1928 as Scuderia Ferrari, the company sponsored drivers and manufactured race cars before moving into production of street-legal vehicles in 1947 as Ferrari S.P.A. Throughout its history, the company has been noted for its continued participation in racing, especially in Formula One where it has employed great success .Rohit once bought a Ferrari. It could go 4 times as fast as Mohan's old Mercedes. If the speed of Mohan's Mercedes is 35 km/hr and the distance traveled by the Ferrari is 490 km, find the total time taken for Rohit to drive that distance.

a) 20.72 b) 3.5 c) 238.25 d) 6.18

ans:Ferrari speed =4*Mercedes speed =4*35=140, t=490/140=3.5

4.1/3) of a number is 3 more than the (1/6) of the same number?

a) 6 b) 7 c) 18 d) 9

ans:x/3=3+x/6 x/3-x/6=3 x/6=3 x=18

5. There are two water tanks A and B, A is much smaller than B. While water fills at the rate of 1 liter every hour in A, it gets filled up like, 10, 20, 40, 80, 160 in tank B. (At the end of first hour, B has 10 liters, second hour it has 20 liters and so on). If tank B is 1/32 filled of the 26 hours, what is total duration of hours required to fill it completely?

a) 26 B) 31 c) 5 d) 27

ans: 1/32 in 26

2/32 in 27

4/32 in 28

8/32 in 29

16/32 in 30

32/32 in 31

6. lady has fine gloves and hats in her closet- 14 blue, 20 red, and 18 yellow. The lights are out and it is totally dark. In spite of the darkness, she can make out the difference between a hat and a glove. She takes out an item out of the closet only if she is sure that if it is a glove. How many gloves must she take out to make sure she has a pair of each color?

a) 50 b) 8 c) 40 d) 42

Solution:

This is the most repeated question in Tcs so prepare it well. It has no logic but it’s answer comes like this

Firstly add 2 max values i.e 20+18=38

Then add 2 to answer i.e. 38+2=40 so this is the answer.

7.There is a square. 5 circles are kept on the diagonal of the square such that the two extreme circles touch the two sides of the square.each circle has equal radius.find the ratio of side of hte squae to that of the radius.

ans: diagonal=(root 2)*a , a= side of the square.

The additon of diameters of all the circles is equal to (root2)*a

2*7*r=(root2)*a

But the two extreme circles wiil not touch at the corners so we have to find those distances.

x=distanse at on corner=r*((root2)-1)

But toal distance=2*x due to 2nd corner

Hence tatladistance=2*x+2*7*r

or 2*x+2*7*r=(root2)*a

Now you can find the ratio easily.

I think that this is oneof the most conceptual question in the paper.

8. A Sheet of paper has statements number from 1 to 20. Statement n says "At least n of the statements on this sheet are true". Which statements are true and which are false.

a. The even no statements are true and the odd no statements are false.

b. The 1st 13 statements are false and rest are true.

c. The 1st 6 statements are true and rest are false

d. The odd no statements are true and even no. are false.

Solution: This type of question was repeated 3 times but for different case.

For this type of Questions, follow this:

At least- Ist half are true, Last half are false

Exactly- Last second one is true or (N-1)th Statement is true

Almost- All are true.

So correct answer is (C)

9. n the planet Oz, there are 8 days in a week- Sunday to Saturday and another day called Oz day. There are 36 hours in a day and each hour has 90 min while each minute has 60 sec. As on earth, the hour hand covers the dial twice every day.

Find the approximate angle between the hands of a clock on Oz when the time is 12:40 am.

Solution: 89 deg

36 hours a day mane the clk will be of 18 hours.

18 hours covrs 360 deg

Thus 1 hour covrs 20 deg

12 hours covers 12*20=240 deg

ekhon,1 hour in 90 min

thus in 90min the hour hand goes 20deg

tai, for 1min hr hand goes 2/9deg

sei jonne, for 40 min hour hnd goes (2/9)*40deg=80/9deg=9deg(approx)

thus hr hand covrs total of 240+9=249deg

now min hand covrs=40*4=160deg

(karon, 90min=360deg

1min=4deg)

hus angle betwn them 249-160=89deg

10. Alok and Bhanu play the following min-max game. Given the expression N = 15 + X*(Y – Z) Where X, Y and Z are variables representing single digits (0 to 9), Alok would like to maximize N while Bhanu would like to minimize it. Towards this end, Alok chooses a single digit number and Bhanu substitutes this for a variable of her choice (X, Y or Z). Alok then chooses the next value and Bhanu, the variable to substitute the value. Finally Alok proposes the value for the remaining variable. Assuming both play to their optimal strategies, the value of N at the end of the game would be?

Note: For this type of questions:

x+y-z=11

x-y-z=2

x*(y+z)=18

What should be the approach to do such type of prob?

Solution: This question was repeated 3 times for different cases

Yeah TCS has this 3 type of questions where there is

x+y-z,=11

x-y-z ==2

and x*(y+z)=18

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[...