A helicopter drops two trains, each on a parachute, onto a
straight infinite railway line. There is an undefined
distance between the two trains. Each faces the same
direction, and upon landing, the parachute attached to each
train falls to the ground next to the train and detaches.
Each train has a microchip that controls its motion. The
chips are identical. There is no way for the trains to know
where they are. You need to write the code in the chip to
make the trains bump into each other. Each line of code
takes a single clock cycle to execute.
You can use the following commands (and only these);
MF - moves the train forward
MB - moves the train backward
IF (P) - conditional that's satisfied if the train is next
to a parachute. There is no "then" to this IF statement.
GOTO
- 7 Answers
- 28768 Views
- ASD Lab, HP, Micro Labs, Microsoft, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / rshadow
After I was asked this question (two weeks after my comment
#3) in a job interview and was guided to the solution - not
before I tried to give the oscillating solution from comment
#2 above, which can't be coded within the limitation of the
4 available commands - I give here the correct and final answer:
start:
MF
MF
MB
if (p) GOTO found
GOTO start
found:
MF
GOTO found
Explanation:
Both trains start moving in the same direction at the same
rate. After one train meets the parachute of the other
train, it starts going at a faster rate and thus will catch
up with the other train and bump into it.
It's a simple solution, but not that easy to come up with.
Seems to be a popular question in job interviews for
programmers in high-tech companies in Israel (me and a
friend were each asked this riddle at a job interview, in
two different companies).
| Is This Answer Correct ? | 26 Yes | 2 No |
Answer / vinayak
MF
IF (P)
GOTO B
GOTO A
-----
B: MF
GOTO B
Explanation: The first line simply gets them off the
parachutes. You
need to get the trains off their parachutes so the back
train can find
the front train's parachute, creating a special condition
that will
allow
it to break out of the code they both have to follow
initially. They
both loop through A: until the back train finds the front
train's
parachute, at which point it goes to B: and gets stuck in
that loop.
The front
train still hasn't found a parachute, so it keeps in the A loop.
Because each line of code takes a "clock cycle" to execute,
it takes
longer
to execute the A loop than the B loop, therefore the back train
(running
in the B loop) will catch up to the front train.
| Is This Answer Correct ? | 12 Yes | 2 No |
Answer / raghav
In answer #4 , I think there is no need of these 3 lines
MF
MF
MB
Instead we can use only 1 line
MF
Both produces the same result but 1 line command is more efficient i think.
| Is This Answer Correct ? | 1 Yes | 0 No |
Answer / jubalau
had this too. i was allowed to number the lines
1 mf
2 if p go to 4
3 go to 1
4 mf
5 go to 4
you could also add more mf lines between lines 4 and 5 for better results i guess...
| Is This Answer Correct ? | 1 Yes | 0 No |
Answer / rshadow
Rajasekar's answer is almost correct, but:
1. i has to be increased by 1 at each iteration of the while
loop.
2. since the 2 trains are facing the same direction at the
start, using this solution will not work - the 2 trains will
always go at the same direction and will never bump into
each other. To overcome this pitfall we need to use a
statement such as 'if (P) STOP', (or: if (P) GOTO END).
notice that above I assume that the condition if (P) is only
satisfied when the train is next to the OTHER train's
parachute. Otherwise, using a counter we can check if the
train is next to its own parachute or not.
| Is This Answer Correct ? | 5 Yes | 6 No |
Answer / rajasekar b
D answer sanket may be wrong. U gotta program both the chips.
and u cant say "MB(T1)" to train T2 and viceversa, neither
"IF(T1 at P1)". There is no way for the trains to know where
they are.
My answer is:
MF;
i=1;
do
{
for(j=1;j<=(i*2)+1;j++)
MB;
for(j=1;j<=(i*2)+2;j++)
MF;
}While(1);
This causes both the trains to oscillate about their
respective parachutes,moving a unit length longer in forward
and backward direction for each oscillation. sure, they
gotta BUMP into each other.
My assumption:
Usual programming language constructs can be used.
Given Commands are just for controlling the train.
| Is This Answer Correct ? | 4 Yes | 11 No |
Answer / sanket
Assumptions - the track goes North-South
Both trains either face or North or South
Two trains are T1 and T2 and their respective parachutes
are P1 and P2
Algorithm/code-
MF(T1) //Moves T1 in forward direction
MF(T2) //Moves T2 in forward direction
Label:If(T1 at P2) MB(T2)
If(T2 at P1) MB(T1)
GOTO Label
Description - Since both trains are facing same direction
(either N or S) if both start moving forward (say toward N)
at some point of time one train will cross other train's
parachute, at which point we reverse the other train. The
trains are now on a collision course.
| Is This Answer Correct ? | 4 Yes | 17 No |
what is the pattern for MAQ Software company
please send me model questions for clerk exam of bank
how to make 31 from five 3s
21 Answers HP, IBM, IK, Infosys,
This is on letter series like if DEFGHI: ABCDEF then NOPQRS:_______
11 Answers EA Electronic Arts, TS,
Convert the following infix expression to post fix notation ((a+2)*(b+4)) -1 (Similar types can be asked)
please send the marketing aptitude,computer knowldege for sbi clerical exam ........ my e-mail id is sneha_o09@yahoo.com
4 Answers State Bank Of India SBI,
A number, when it is divided by 8 it gives a remainder 3 and is divisible by both 3 and 5. Find the number.
If g(x)=x-1/x then g (-1/2)=? Pls explain
If any body having sample papers for NIC please mail me at Poojakalra_leo@yahoo.co.in
There are 6561 cricket balls out of them 1 is heavy. Find the minimum no. of times the cricket balls have to be weighed for finding out the heavy ball.
In how many rows will 200 Miranda bottles be placed, if 200 Miranda bottles are stacked in such a way that there are 20 bottles in the bottom, 19 in the next row, 18 in the row next and so on?
FIND the next number in the series 11,112,1124,11248,--
English 
