| Author |
Message |
    
Andhrudu
Kurra Bewarse
Username: Andhrudu
Post Number: 144
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 30, 2004 - 9:14 am: |    |
Answer for the puzzle:
To summarize the question:
There are 12 identical pills. Only one is of different weight, don’t know lesser or more than usual.
You have to find the odd one in just 3 weighs.
Now, name the pills as A, B, C, D, E, F, G, H, I, J, K, L.
<,>, = is the result of each weighing. Now we have to design the candidates to weighed elegantly so that each combination of the result of the weighs is uniquely associated with an element and definitely associated with an element.
Various combinations would be:
<<<,>, <=<,>, …
Let us associate each combination with a letter/pill.
i.e., <<< is A, <<= is B, …
Here again we have another constraint that the number of ‘<’>’, because the weigh should be balanced with equal no of pills on both sides.
After looking/trying with different combinations, I came up with this combination that satisfies all the constraints.
A < = =
B = < =
C = = <
D <<>
E <> <
F > < <
G <> =
H = <>
I > = <
J > > =
K > = >
L = > >
You can observe that no two combinations collide in this case: e.g., <<=>>= will create ambiguity.
Hence with this combination, the weighs would be :
ADEG : FIJK
BDFH : EGJL
CEFI : DHKL
|
Andhrudu
Kurra Bewarse
Username: Andhrudu
Post Number: 141
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Tuesday, June 29, 2004 - 8:03 am: | |
Print numbers from 100 to 1.
#include <stdio.h>
void ( * a [ 2 ] ) ( ) ;
void func1 ( int i )
{
printf ( "%d\n", i ) ;
}
void func ( int i )
{
printf ( "%d\n", i ) ;
i -- ;
a [ ( i + 99 ) / 100 ] ( i ) ;
}
main ( )
{
a [ 0 ] = func1 ;
a [ 1 ] = func ;
a [ 1 ] ( 100 ) ;
} |
Plz_kissme
Celebrity Bewarse
Username: Plz_kissme
Post Number: 2080
Registered: 03-2004
Posted From: 164.107.188.31
Rating:N/A
Votes: 0(Vote!) | | Posted on Thursday, June 24, 2004 - 2:54 pm: | |
CHIRU RULES |
Andhrudu
Kurra Bewarse
Username: Andhrudu
Post Number: 133
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Thursday, June 24, 2004 - 5:22 am: | |
. |
Andhrudu
Kurra Bewarse
Username: Andhrudu
Post Number: 126
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Saturday, June 19, 2004 - 9:41 am: | |
>> naatho raa, gooba meeda naalugu istaa
 |
Billa_pichodu
Kurra Bewarse
Username: Billa_pichodu
Post Number: 373
Registered: 04-2004
Posted From: 195.47.45.58
Rating:N/A
Votes: 0(Vote!) | | Posted on Friday, June 18, 2004 - 5:26 pm: | |
>>>>Write a program to print numbers from 100 to 1 without using any conditional statement.
inta simple Qs enteha
printf("100");
printf("99");
printf("98");
printf("97");
'
'
'
alaa raaskelli
final gaa
'
'
'
printf("3");
printf("2");
printf("1");
{ naatho raa, gooba meeda naalugu istaa} |
Andhrudu
Kurra Bewarse
Username: Andhrudu
Post Number: 125
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Friday, June 18, 2004 - 11:38 am: | |
sollu mama, loops are also conditional statements kindake vastayi mama.
oka hint: Function pointers use cheyyali. |
Sollu
Censor Bewarse
Username: Sollu
Post Number: 1447
Registered: 03-2004
Posted From: 67.170.139.13
Rating:N/A
Votes: 0(Vote!) | | Posted on Friday, June 18, 2004 - 10:19 am: | |
for(i=100;i>0;i--)
printf(i);
sorry 100 to 1 kada ayithe idi
|
Sollu
Censor Bewarse
Username: Sollu
Post Number: 1446
Registered: 03-2004
Posted From: 67.170.139.13
Rating:N/A
Votes: 0(Vote!) | | Posted on Friday, June 18, 2004 - 10:18 am: | |
for(i=0;i<100;i++)
printf(i+1);
ok na mama? lekapothe i<100 kuda condition loki ellipodda.... |
Andhrudu
Kurra Bewarse
Username: Andhrudu
Post Number: 117
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Friday, June 18, 2004 - 6:09 am: | |
The answer for the classic weighing puzzle and the programming question is there in the link given.
But for the puzzle, if a condition is imposed that you should provide a static answer, and there should not be any ifs and elses, then think of the solution.
Another programming question:
Write a program to print numbers from 100 to 1 without using any conditional statement.
Mamalu, if you have some interesting puzzles/algorithm questions please post here. These would be entertaining as well as very useful as they are asked in many interviews also. |
Andhrudu
Pilla Bewarse
Username: Andhrudu
Post Number: 116
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Friday, June 18, 2004 - 6:04 am: | |
Ok Manishi, thanks for quitting from my thread.
I will be relieved of arguing with people who ask silly questions and claim there is no answer and that is the trick.
|
Manishi
Pilla Bewarse
Username: Manishi
Post Number: 56
Registered: 06-2004
Posted From: 129.9.163.233
Rating:N/A
Votes: 0(Vote!) | | Posted on Thursday, June 17, 2004 - 10:31 am: | |
Wow ! Andhrudu mama ! take it easy ! What did I preach mama? I was just merely pointing that answers to such questions can be found on the web.
Indilo malli over smart acting emundhi mama? If I was trying to act smart , I would have posted the solutions claiming that I solved it by myself ,instead of giving you the answer link.
sare mama , nee threadlo inka postanu le mama !
And coming to my question, TRICK is the keyword.
As such there is NO ANSWER to the question I posted. The trick here is recongnize that there is no answer to such silly questions, but most people without realizing that try to answer the question.
|
Andhrudu
Pilla Bewarse
Username: Andhrudu
Post Number: 94
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Thursday, June 17, 2004 - 10:11 am: | |
Manishi mama,
Show me the answer for my 1st C programming question and the two elephants problem in the link that you claim to have answers for all the questions that I posted.
Also, the solution for the weighing problem is a bit confusing in the link you have given. Can you give a more simple approach?
If you think people do not want to visit this type of thread, why did you visit this thread?
People who are interested will join here. Don't spoil this thread by preaching or rubbing your ideas here.
What is the motto behind you asking the junk question "What goes up a mountain with 3 legs and comes down with 4 legs?" Who is going to benefit with such questions? If you are a manishi first answer the question that you posted. This clearly shows your true motives and colours.
For your kind information I am posting in the subheading of "technology - talk only tech".
Don't try to act over smart by preaching others. First look back at yourself and then post. |
Manishi
Pilla Bewarse
Username: Manishi
Post Number: 55
Registered: 06-2004
Posted From: 129.9.163.233
Rating:N/A
Votes: 0(Vote!) | | Posted on Thursday, June 17, 2004 - 9:42 am: | |
Andhrudu mama,
Most people come here for entertainment and the least thing they want is to break their heads over some math. Open a quiz on cinemas
So that is the reason why you don't find many people participating in this.
Any here is the answer for the weighing problem
http://www.techinterview.org/Solutions/fog00000001 16.html
And the answers for all puzzles can be found here
http://www.techinterview.org/archive.html
|
Andhrudu
Pilla Bewarse
Username: Andhrudu
Post Number: 92
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Thursday, June 17, 2004 - 8:54 am: | |
Manishi mama,
Good catch. But all these questions are necessarily not from the same site. They are available at many sites and they are more popular as the questions which were asked in microsoft interviews.
When I posted the links that you posted, nobody responded. So I started to post each question.
It will be good if you also participate and ask some questions which would be helpful to us.
Regarding the question that you asked I know that it is a part of the famous joke between a scientist and poet. Please do post some really meaningful questions not necessarily invented by you. |
Manishi
Pilla Bewarse
Username: Manishi
Post Number: 54
Registered: 06-2004
Posted From: 129.9.163.233
Rating:N/A
Votes: 0(Vote!) | | Posted on Thursday, June 17, 2004 - 8:17 am: | |
Andrudu,
Here are some links which discusses all your questions.
Find if the given number is a power of 2
http://discuss.fogcreek.com/techInterview/default. asp?cmd=show&ixPost=2013&ixReplies=4
Folding the paper
http://discuss.fogcreek.com/techInterview/default. asp?cmd=show&ixPost=1959&ixReplies=7
http://discuss.fogcreek.com/techInterview/default. asp?cmd=show&ixPost=1988&ixReplies=3
Elephant Question
http://discuss.fogcreek.com/techInterview/default. asp?cmd=show&ixPost=1905&ixReplies=6
Rail/man speed question
http://discuss.fogcreek.com/techInterview/default. asp?cmd=show&ixPost=1868&ixReplies=6
And all other questions to be coming from andhrudu can be found here
http://discuss.fogcreek.com/techInterview/
Weighing question
http://www.techinterview.org/Puzzles/fog0000000046 .html
Andhrudu mama answer this tricky question:
What goes up a mountain with 3 legs and comes down with 4 legs?
|
Andhrudu
Pilla Bewarse
Username: Andhrudu
Post Number: 91
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Thursday, June 17, 2004 - 7:42 am: | |
Answering this problem is tough, and explaining the answer to this problem and make everyone understand it is even tougher. |
Andhrudu
Pilla Bewarse
Username: Andhrudu
Post Number: 90
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Thursday, June 17, 2004 - 7:40 am: | |
Now a really tough problem. This is my favourite puzzle.
the evil king from before sends his own assassin to take care of the evil queen who tried to poison him. of course, her trusty guards catch the assassin before any harm is done. the queen notices that the assassin is quite handsome and doesn't really want to punish him by death. she decides to test his wisdom.
the queen gives the assassin 12 pills which are all completely identical in shape, smell, texture, size, except 1 pill has a different weight. the queen gives the man a balance and tells him that all the pills are deadly poison except for the pill of a different weight. the assassin can make three weighings and then must swallow the pill of his choice. if he lives, he will be sent back to the bad king's kingdom. if he dies, well, thats what you get for being an assassin.
only one pill is not poison and it is the pill which has a different weight. the assassin does not know if it weighs more or less than the other pills. how can he save his skin?
|
Andhrudu
Pilla Bewarse
Username: Andhrudu
Post Number: 89
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Thursday, June 17, 2004 - 7:26 am: | |
Try the programming question also. |
Andhrudu
Pilla Bewarse
Username: Andhrudu
Post Number: 88
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Thursday, June 17, 2004 - 7:25 am: | |
Good OT mama. Good explaination. |
Onlytruth
Yavvanam Kaatesina Bewarse
Username: Onlytruth
Post Number: 1013
Registered: 03-2004
Posted From: 196.12.48.114
Rating:N/A
Votes: 0(Vote!) | | Posted on Thursday, June 17, 2004 - 7:16 am: | |
Assume that, instead of running back 1/4 th part he covered already in TUNNEL ,that man ran in forward direction.. ok..
NOW he is exaclty @ half mark in the TUNNEL.
Now train is at entry of the tunnel.
If that man proceeds forward from half mark to end of the tunnel, by that time train also exactly reaches the END of the tunnel.
i.e TRAIN and MAN started from start and midway of the tunnel respectively at the same time and reached at a time to end of the TUNNEL.
in other words TRAIN covered double distance than the man for a given time period.
hence the answer
....................
for this puzzle credit goes to my colleague
Don't feel bad. A lot of people have no talent |
Andhrudu
Pilla Bewarse
Username: Andhrudu
Post Number: 87
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Thursday, June 17, 2004 - 7:04 am: | |
Correct OT mama.
Explaination kooda iccheyyi. |
Onlytruth
Yavvanam Kaatesina Bewarse
Username: Onlytruth
Post Number: 1012
Registered: 03-2004
Posted From: 196.12.48.114
Rating:N/A
Votes: 0(Vote!) | | Posted on Thursday, June 17, 2004 - 6:57 am: | |
Train's speed = 2 * Man's speed
Don't feel bad. A lot of people have no talent |
Andhrudu
Pilla Bewarse
Username: Andhrudu
Post Number: 85
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Thursday, June 17, 2004 - 6:17 am: | |
. |
Andhrudu
Pilla Bewarse
Username: Andhrudu
Post Number: 77
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Thursday, June 17, 2004 - 3:18 am: | |
Another puzzle:
a man needs to go through a train tunnel. he starts through the tunnel and when he gets 1/4 the way through the tunnel, he hears the train whistle behind him. you don't know how far away the train is, or how fast it is going, (or how fast he is going). all you know is that
if the man turns around and runs back the way he came, he will just barely make it out of the tunnel alive before the train hits him.
if the man keeps running through the tunnel, he will also just barely make it out of the tunnel alive before the train hits him.
assume the man runs the same speed whether he goes back to the start or continues on through the tunnel. also assume that he accelerates to his top speed instantaneously. assume the train misses him by an infintisimal amount and all those other reasonable assumptions that go along with puzzles like this so that some wanker doesn't say the problem isn't well defined.
how fast is the train going compared to the man?
|
Andhrudu
Pilla Bewarse
Username: Andhrudu
Post Number: 76
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Thursday, June 17, 2004 - 3:12 am: | |
Another programming question:
How do you find if a number is power of 2 in an efficient way? |
Andhrudu
Pilla Bewarse
Username: Andhrudu
Post Number: 75
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Thursday, June 17, 2004 - 3:10 am: | |
Solution for the two elephants problem:
With the two elephants, you have to travel 4times to carry any no. of bananas between 2000 and 3000, i.e., 4b/km.
At this rate of 4b/km, 1000 bananas will be over in 250kms.
Now, after 250kms, there are 2000 bananas and 750kms left, each elephant takes 750 bananas to travel the rest of the distance.
Hence, 2000 - ( 2 * 750 ) = 500 bananas are left. |
Andhrudu
Pilla Bewarse
Username: Andhrudu
Post Number: 73
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Thursday, June 17, 2004 - 1:59 am: | |
Answer for the programming question:
Segmentation fault occurs and the program terminates.
Since main is called recursively infinite times, the stack size used for function calls, grows infinitely and exceeds its allowed size, thus causing segmentation fault violation, core is dumped and program terminates. |
Andhrudu
Pilla Bewarse
Username: Andhrudu
Post Number: 67
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Thursday, June 17, 2004 - 12:15 am: | |
Musicfan I got only 500. If you can do with 666 bananas that will be great.
Remember that both the elephants also should reach the destination. |
Musicfan
Pilla Bewarse
Username: Musicfan
Post Number: 8
Registered: 05-2004
Posted From: 134.244.170.168
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 1:36 pm: | |
Andhrudu is it 666 bananas for two elephants to reach the city B? |
Deyyam
Kurra Bewarse
Username: Deyyam
Post Number: 478
Registered: 06-2004
Posted From: 157.182.82.243
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 11:09 am: | |
opika ledhu
Sanditlo sademiya, roju tinta semiya |
Sollu
Censor Bewarse
Username: Sollu
Post Number: 1393
Registered: 03-2004
Posted From: 67.170.139.13
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 10:40 am: | |
hmm idi sadiva kani gurthu ledu mama |
Andhrudu
Pilla Bewarse
Username: Andhrudu
Post Number: 66
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 9:44 am: | |
Now a programming question.
What happens when you run the following program:
main ( )
{
main ( ) ;
} |
Andhrudu
Pilla Bewarse
Username: Andhrudu
Post Number: 65
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 9:21 am: | |
Mama, is anyone trying or shall I say the answer. |
Andhrudu
Pilla Bewarse
Username: Andhrudu
Post Number: 64
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 9:07 am: | |
there are 2 cities A and B, dist. between them is 1000 Km
we have 3000 bananas in city A and a elephant
can carry max 1000 bananas at any given time and it needs to eat a banana every 1 Km.
There are 2 elephants in city A.
How Many Max. No. of bananas u can tranfer to city B??? Also, the 2 elephants at city A should reach the city B.
note : the elephant cannot go without bananas to eat. |
Onlytruth
Yavvanam Kaatesina Bewarse
Username: Onlytruth
Post Number: 998
Registered: 03-2004
Posted From: 196.12.48.114
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 9:03 am: | |
2 elephants ki question clear ga ledhu..
no of bananas and no of KMs every thing same aa?
all we want to do is ..try to shift max no of bananas isnt it ?
Don't feel bad. A lot of people have no talent |
Andhrudu
Pilla Bewarse
Username: Andhrudu
Post Number: 63
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 9:00 am: | |
Mama, two elephants ki answer cheppandi. |
Onlytruth
Yavvanam Kaatesina Bewarse
Username: Onlytruth
Post Number: 997
Registered: 03-2004
Posted From: 196.12.48.114
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 8:58 am: | |
this elephant puzzle is good one guys..
even if u give the answer 533 ..we cannot understand how ?
Don't feel bad. A lot of people have no talent |
Andhrudu
Pilla Bewarse
Username: Andhrudu
Post Number: 61
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 8:52 am: | |
Is my answer clear?
I wanted to say that the elephant carries 1000 bananas for 200kms, drop 600 there, return and carry 1000 more, drop 600, return and carry the rest 1000. It will now be left with 2000. ... |
Andhrudu
Pilla Bewarse
Username: Andhrudu
Post Number: 60
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 8:49 am: | |
Carrying 1km by 1km is correct solution but let us try for more elegant solution so that we can put less burden on the elephant.
If it travels 1km by 1km, it has to travel 5 times per each km to carry the whole bunch of bananas, i.e., 5bananas/km.
But after 200 kms it will be left with only 2000 bananas, so from then onwards it takes only 3b/km.
Again after another 333kms it will be left with only 1000 bananas, so for the rest of 467kms it takes only 1b/km.
So 1000-467=533b.
Infact it will 534b if there is a condition that the elephant eats a banana and then travels a km.
Because at the end of 533kms ( 200 + 333 ) it will be left with 1001 bananas.
If it eats one banana and then starts carrying 1000 bananas for the rest of distance, it will require only 466 more bananas, so the answer is 534 bananas.
Now cany you try for two elephants, the condition is that both the elephants should reach the other end. |
Onlytruth
Yavvanam Kaatesina Bewarse
Username: Onlytruth
Post Number: 996
Registered: 03-2004
Posted From: 196.12.48.114
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 8:47 am: | |
533 ??? how ?
i got the logic behind that ..but exact answer i want..
Don't feel bad. A lot of people have no talent |
Godfather
Bewarse Legend
Username: Godfather
Post Number: 3528
Registered: 03-2004
Posted From: 62.90.177.204
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 8:34 am: | |
ni venks!! na last post lone answer vundhi mamalu
mundu 1000 carry chesi!! koncham duram vellaka vatini vodili venakaki tirig vachi!! itta calculation chesukondi mamalu vachestundhi
MD : DEVDAS CLUB    |
Godfather
Bewarse Legend
Username: Godfather
Post Number: 3527
Registered: 03-2004
Posted From: 62.90.177.204
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 8:33 am: | |
naku telisipoyindhi answer
chepta vundani
MD : DEVDAS CLUB |
Andhrudu
Pilla Bewarse
Username: Andhrudu
Post Number: 58
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 8:31 am: | |
Answer is 533.
I will post in detail in next message. |
Andhrudu
Pilla Bewarse
Username: Andhrudu
Post Number: 57
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 8:30 am: | |
GodFather mama, elephant ni atu itu kakunda madhyalo vodileyyalemu kadha. Elephant ni madhyalo ammesthe ok. |
Onlytruth
Yavvanam Kaatesina Bewarse
Username: Onlytruth
Post Number: 991
Registered: 03-2004
Posted From: 196.12.48.114
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 8:26 am: | |
answer ika cheppu mama ...TIME OUT
Don't feel bad. A lot of people have no talent |
Godfather
Bewarse Legend
Username: Godfather
Post Number: 3525
Registered: 03-2004
Posted From: 62.90.177.204
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 8:25 am: | |
ledu mama 3 vunte 333 km taruvatha oka elephant ni vodileya vachu!! a banans ni vere vati mida peta vachu!!
na bondha okate vunte!! daniki return ticket kinda malli petali!! inko 3000 appu tisukovali kiki
MD : DEVDAS CLUB |
Andhrudu
Pilla Bewarse
Username: Andhrudu
Post Number: 56
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 8:18 am: | |
1 elephantee vundi mama.
3 vunte chala teesukellalemu mama. 3000 bananas aa 3 elephants thintanike saripothayi. Appudu okka banana kooda cheradu. |
Godfather
Bewarse Legend
Username: Godfather
Post Number: 3521
Registered: 03-2004
Posted From: 62.90.177.204
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 8:10 am: | |
elephant okate vunda!! 3 vunte chala tisukuvellavachu!!
MD : DEVDAS CLUB |
Andhrudu
Pilla Bewarse
Username: Andhrudu
Post Number: 55
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 8:01 am: | |
If it travels 1km by 1km, it can carry the maximum bananas to the destination.
Though it is correct answer, think of more elegant answer so that the elephant need not make so many roundabout turns. Also calculate the number of bananas that are left when it reaches the destination. |
Kingchoudary
Yavvanam Kaatesina Bewarse
Username: Kingchoudary
Post Number: 693
Registered: 03-2004
Posted From: 202.54.130.129
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 7:51 am: | |
Andrudu mama,
Mana VP janalaki ilaantivi yetta nachuthayi mama, ade nuvvu Raasi sizu lu thelusa ani oka thread open cheyyi kottuka chastharu.
Answer nuvve cheppu mama.
Prapancham chala pedhadi. |
Andhrudu
Pilla Bewarse
Username: Andhrudu
Post Number: 53
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 7:42 am: | |
Emiti mama evaru try cheyatam ledha? Inko hint kavala? |
Andhrudu
Pilla Bewarse
Username: Andhrudu
Post Number: 48
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 7:18 am: | |
It has to travel 1000km. There is no trick in the question. |
Onlytruth
Yavvanam Kaatesina Bewarse
Username: Onlytruth
Post Number: 986
Registered: 03-2004
Posted From: 196.12.48.114
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 7:12 am: | |
CIty A and B how they are located geographically ?
is it must to travel 1000 kms to reach B from A ??
or circular way traingular way are there?
Don't feel bad. A lot of people have no talent |
Onlytruth
Yavvanam Kaatesina Bewarse
Username: Onlytruth
Post Number: 984
Registered: 03-2004
Posted From: 196.12.48.114
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 7:05 am: | |
deithadhi mama...
Don't feel bad. A lot of people have no talent |
Deithadi
Mudiripoyina Bewarse
Username: Deithadi
Post Number: 1263
Registered: 03-2004
Posted From: 65.29.77.48
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 7:03 am: | |
Aakoti endhuku 1st kochen ki answer cheppinduku nuvvu esesko |
Andhrudu
Pilla Bewarse
Username: Andhrudu
Post Number: 45
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 7:02 am: | |
Hint: Split the journey into shorter ones in efficient way. |
Andhrudu
Pilla Bewarse
Username: Andhrudu
Post Number: 44
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 6:59 am: | |
No OT mama. Try, you will get a good number of bananas to B.
|
Onlytruth
Yavvanam Kaatesina Bewarse
Username: Onlytruth
Post Number: 983
Registered: 03-2004
Posted From: 196.12.48.114
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 6:56 am: | |
ONLY ONE BANANA WE CAN shift from CITY A TO CITY B
Don't feel bad. A lot of people have no talent |
Andhrudu
Pilla Bewarse
Username: Andhrudu
Post Number: 43
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 6:51 am: | |
OT mama, yes it is amazing.
I am reposting the second question here mama:
There are 2 cities A and B, dist. between them is 1000 Km
we have 3000 bananas in city A and a elephant
can carry max 1000 bananas at any given time and it needs to eat a banana every 1 Km
How Many Max. No. of bananas u can tranfer to city B???
note : the elephant cannot go without bananas to eat.
i.e., the elephant can eat one banana and then only can travel 1km. |
Onlytruth
Yavvanam Kaatesina Bewarse
Username: Onlytruth
Post Number: 982
Registered: 03-2004
Posted From: 196.12.48.114
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 6:44 am: | |
andhrudu..nee second puzzle NOTE lo last lo koncham clarity ledhu..
Don't feel bad. A lot of people have no talent |
Onlytruth
Yavvanam Kaatesina Bewarse
Username: Onlytruth
Post Number: 981
Registered: 03-2004
Posted From: 196.12.48.114
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 6:39 am: | |
andhrudu mama.. if we put ur first question and answer together in words...
If u fold a 1 mm thickness paper just 37 times, its width will become 1,00,000 KM (if width doubles each time you fold it. )
isn't it amazing ??
Don't feel bad. A lot of people have no talent |
Onlytruth
Yavvanam Kaatesina Bewarse
Username: Onlytruth
Post Number: 980
Registered: 03-2004
Posted From: 196.12.48.114
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 6:34 am: | |
em chupinchaadenti ?
Don't feel bad. A lot of people have no talent |
Kingchoudary
Yavvanam Kaatesina Bewarse
Username: Kingchoudary
Post Number: 686
Registered: 03-2004
Posted From: 202.54.130.129
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 6:32 am: | |
>>yevaraame ?
chee chee nenu PD lanti vaadini kaanu mama. Monna rethiri NGC channel chusi thelusukunna.
Prapancham chala pedhadi. |
Onlytruth
Yavvanam Kaatesina Bewarse
Username: Onlytruth
Post Number: 979
Registered: 03-2004
Posted From: 196.12.48.114
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 6:30 am: | |
Monna rethiri thelusukonna mama.
>>>
yevaraame ?
Don't feel bad. A lot of people have no talent |
Andhrudu
Pilla Bewarse
Username: Andhrudu
Post Number: 42
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 6:27 am: | |
OT, you are correct, the answer is 37.
Ok here is another puzzle:
there are 2 cities A and B, dist. between them is 1000 Km
we have 3000 bananas in city A and a elephant
can carry max 1000 bananas at any given time and it needs to eat a banana every 1 Km
How Many Max. No. of bananas u can tranfer to city B???
note : the elephant cannot go without bananas to at.
|
Kingchoudary
Yavvanam Kaatesina Bewarse
Username: Kingchoudary
Post Number: 685
Registered: 03-2004
Posted From: 202.54.130.129
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 6:27 am: | |
Monna rethiri thelusukonna mama.
Prapancham chala pedhadi. |
Onlytruth
Yavvanam Kaatesina Bewarse
Username: Onlytruth
Post Number: 977
Registered: 03-2004
Posted From: 196.12.48.114
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 6:24 am: | |
KC maava LOL
inthaki nee signature ni eppudu telsukunnav ?
Don't feel bad. A lot of people have no talent |
Onlytruth
Yavvanam Kaatesina Bewarse
Username: Onlytruth
Post Number: 976
Registered: 03-2004
Posted From: 196.12.48.114
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 6:23 am: | |
oooooooops
2x = 1,000,000,00,000 (1followed by 11 zeroes)
X = desired answer
Don't feel bad. A lot of people have no talent |
Kingchoudary
Yavvanam Kaatesina Bewarse
Username: Kingchoudary
Post Number: 683
Registered: 03-2004
Posted From: 202.54.130.129
Rating:
Votes: 3(Vote!) | | Posted on Wednesday, June 16, 2004 - 6:22 am: | |
Yenti mana DB lo ittantivi kooda postaochaa,
Prapancham chala pedhadi. |
Onlytruth
Yavvanam Kaatesina Bewarse
Username: Onlytruth
Post Number: 975
Registered: 03-2004
Posted From: 196.12.48.114
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 6:19 am: | |
2x = 1,000,000,000,000
X = desired answer
Don't feel bad. A lot of people have no talent |
Andhrudu
Pilla Bewarse
Username: Andhrudu
Post Number: 40
Registered: 06-2004
Posted From: 203.200.54.66
Rating:N/A
Votes: 0(Vote!) | | Posted on Wednesday, June 16, 2004 - 5:55 am: | |
Let us discuss on interesting puzzles and programming questions here.
The following is a question asked in microsoft interviews:
U have infinite supply of paper
thickness of paper is 1mm
distance between earth and moon is 1,00,000 Km
every time we fold the paper so its thickness doubles
how many folds will be needed so that the thickness becomes >= distance between earth and moon
|
