Number/Quant Based DI

Two brothers A and B are standing at a point P on a highway. They start playing a game with a die. The die is in form of a cube with integers 1 to 6 written on its six faces with one number on each face. Each one of them throws the die alternately. If the number appearing on the top face of the die is greater than the number appeared in the previous throw by the
same brother then he moves forward (towards point Q situated on the same highway) by the number of steps equal to the number that appears on the top face of the die. If the number appearing on the top face of the die by a brother is less than the number appeared in the previous throw on the top face of the die, then that brother moves backwards (towards point P) by the number of steps equal to the number that appears on the top face of the die . If the number appearing on the top face of the die in a throw by a
brother is same as that in the previous throw by him, then the throw is considered as cancelled and he throws the die again till a different number appears on the top face of the die. If after a throw, someone needs to take certain number of backward steps which prompts him to go even behind P, that throw is also considered as cancelled. In this case he has to throw the die again. In their first throw, these brothers move forward (towards Q) by the number of steps equal to the number that appears on the top face of the die (as they do not have any previous score to compare it with). Length of steps of these brothers is always same and constant. Round ‘n’ comprises nth throw of both the brothers.

What can be the maximum possible distance between the two brothers after the first 4 rounds?
(1) 24 steps (2) 18 steps (3) 12 steps (4) 10 steps

If the number appearing on the top face of the die in 6 consecutive throws by A are distinct and 6 appears in the third throw, then what can be the maximum possible distance (towards Q) covered by A in these 6 throws?
(1) 12 steps (2) 14 steps (3) 19 steps (4) 18 steps

If A reaches Q without taking any backward step ever, what can be the maximum distance between P and Q?

If there was at least one throw in which A moves backwards (towards P) and A traveled 27 steps in the forward direction (towards Q), then the minimum possible number of times A threw the dice is
(1) 12 (2) 8 (3) 9 (4) 7

In a particular throw by B, the number that appeared on the top face of the die was 1 and after that throw B was 14 steps ahead of A. Find the minimum possible number of throws required such that the distance between the two brothers becomes zero. A had got 1 on the top face of the die in his last throw.
(1) 3 (2) 2 (3) 5 (4) 4

1 comments

XHTML: You can use these tags: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <s> <strike> <strong>

Recent Forum Posts/Questions/Answers