Interested to Buy Any Domain ? << Click Here >> for more details...
1) You have 8 coins. 3 of them weigh x units, 3 y
units, 1 a units and 1 b units. They are all mixed and look
identical. You have to find the lightest coin in minimum
number of weighing .
- 9 Answers
- 18215 Views
- Bhel, Mechanical, Microsoft, Oracle, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / pratik taank
Hi Dinesh,
This is regarding ur above answer.
i think u are wrong.
Step-1 is ok.
Step-2 is not - Plz see explanation below.
When in step-2 u divide 4 coins in 2 pairs, it is not necessary that lighter coin will be on the lighter side, it can be on a heavier side for ex -
there r 4 coins, their wts are 2gm, 8gm, 3gm, 4gm
put them in balance- 2gm and 8gm on 1 side
3gm and 4gm on other side.
now the lighter coins is in heavier side, now u have ignored this logic. try something new buddy!!!
| Is This Answer Correct ? | 6 Yes | 1 No |
Answer / pratik
Shreyas, you don't know which is x and which is y (since
all coins are alike) , that was mistake i was doing before.
| Is This Answer Correct ? | 5 Yes | 4 No |
Answer / ankita
We can make pair of two. Then out of each pair, find out the lightest and then form two pairs. Again find the lightest coin in each pair and then form a pair of obtained coins. Lightest of these two is the one required. Total 7 steps. I think this is the answer.
| Is This Answer Correct ? | 4 Yes | 4 No |
Answer / shreyas
They look alike means that they are identical in size and shape.
It can still be named as X, Y, A and B.
Its like Rs.1, Rs.2, Rs.3 are in the same shape and size. But you can tell which is what.
| Is This Answer Correct ? | 5 Yes | 8 No |
Answer / dinesh thouna
as there are 8 coins..put 4 on one side and the other remaining 4 on the other side.. obviously one side will be lighter..
now the possible combinations of coins which can be on the lighter side are:
1)x,x,,x,a 2)x,x,x,b 3)x,x,x,y 4)x,x,y,y 5)3)x,x,y,a 4)x,x,y,b 5)x,x,a,b 6)x,y,a,b 7)x,y,y,a 8)x,y,y,b 9)x,y,y,y 10)y,y,y,a 11)y,y,y,b 12)y,y,a,b
well whatever the combination be, you need to divide it again into a group of 2-2..you will again get a lighter group..finally compare the last two coin and u will get the lightest coin of the 8 coins given...
so, that makes a total of 3 steps..
thumbs up..!! :)
# refer the above possibilities to get a clearer picture
| Is This Answer Correct ? | 2 Yes | 5 No |
Answer is 1.
We will use a weigh measurement machine.
Initially, it will show weight @ zero. Now start putting coin one-by-one and measure the weight every-time a coin is placed. Where the difference in unit weight is minimum, then that coin will be the lightest.
Eg. when coin 1 is placed- total weight = 30 gms
when coin 2 is placed- total weight = 40 gms (cumulatively)
when coin 3 is placed- total weight = 45 gms (cumulatively)
So the lightest coin is 3rd coin.
| Is This Answer Correct ? | 7 Yes | 12 No |
Answer / shreyas
Weigh X and Y. And see which is the lightest.
take the lightest of X and Y and weigh it against A or B. See which is the lightest among them and weigh it against the remaining coin.
So the answer is 3 weighs.
| Is This Answer Correct ? | 2 Yes | 15 No |
Answer / pratik
3
1. 3 coins of x unit on 1 side and 3 coins of y unit on the
other (let winner is x)
2. a coin of a unit on 1 side and a coins of b unit on the
other (let winner is a)
3. a on 1 side and x on the other (winner declared)
| Is This Answer Correct ? | 13 Yes | 30 No |
If you added together the number of 2's in each of the following sets of numbers, which set would contain the most 2's: 1-333, 334-666, or 667-999?
There is a number that is 5 times the sum of its digits. What is this number? Answer is not 0.
Implement a multiple-reader-single-writer lock given a compare-and-swap instruction. Readers cannot overtake waiting writers.
In a group of 25, 13 can speak Latin, 15 can speak French, and 6 don’t speak either. How many of these speak both Latin and French?
Imagine that u r driving a car from mysore to bangalore at a speed of 75mph.car no is KA-19 DB1955. distance between bangalore and mysore is 250 Km..... Now tell me wat s the date of birth of the driver............
25 Answers ADP, AP, BPO, CTS, HOV Services, HSBC, Infosys, Prodapt, Vodafone,
A B C D E F G H I Each of the digits from 1 to 9 is represented by a different letter above. Also, A + B + C = C + D + E = E + F + G = G + H + I = 13 Which digit does E represent?
There are 3 ants at 3 corners of a triangle, they randomly start moving towards another corner. What is the probability that they don't collide?
Five horses ran in the race. ? There were no ties. ? Sikandar did not come first. ? Star was neither first nor last. ? Mughal Glory came in one place after Sikandar. ? Zozo was not second. ? Rangila was two place below Zozo. In what order did the horses finish?
Submit Answer Users Answer (48) BrainVista Answer Puzzle A Friend Add to Favourite Back to Search Result Hello sajeesh murali ? my Answers ? my Favourites ? Modify Personal Info ? Subscribe ? Logout ? Jigsaw Puzzle ? Join the Dots ? Marbles Game ? Balls Game ? Towers of Hanoi ? Think Number ? Find A Day Brain Teaser No Three Gold (G) coins, three Silver (S) coins and three Copper (C) coins are arranged in a single row as follow: G S C G S C G S C ? Only 2 adjacent unlike coins can be moved at any one time. ? The moved coins must be in contact with at least one other coin in line. i.e. no pair of coins is to be moved and placed away from the remaining ones. ? No coin pairs can be reversed i.e. a S-C combination must remain in that order in its new positionwhen it is moved. What is the minimum number of moves required to get all the coins in following order? C C C S S S G G G Show all moves.
Given a sequence of integers, there are a few sequences which result in balanced binary search trees i.e., AVL trees. Write a program that takes a sequence of integers as input and outputs the number of such sequences that result in the balanced binary search trees. Input Format: Single line contains sequence of integers terminated by -1. Output format: Print the number of AVL tree possible from that input sequence. Sample Input: 1 2 3 -1 Sample Output: 2
What will come in place of the question mark (?) in the following questions? 11.7589 ? ? = 3434 (a)3721 (b)4155 (c)3246 (d)11023 (e)None of these
You have 8 marbles. 7 marbles weigh 1 ounce each, & one marble weighs 1.5 ounces. You are unable to determine which is the heavier marble by looking at them. You have a weighing scale that consists of 2 pans, but the scale is only good for 2 total weighings. How can you determine which marble is the heaviest one using the scale & in 2 weighings?
English 
