A soldier looses his way in a thick jungle at random walks from his camp but mathematically in an interesting fashion. First he walks one mile east then half mile to north. Then 1/4 mile to west, then 1/8 mile to south and so on making a loop. Finally hoe far he is from his camp and in which direction.

0 Answers   InfoTest,

---

12 revolutions takes 1/8 th second time.In 20 seconds how many revolutions?

7 Answers   Citi Bank, CitiGroup, Ramco,

---

what are the questions likely to be prepare for sbi clerical exam...........

1 Answers  

---

Every station in N rail road issue every other station's ticket. some stations are added.Now they have to issue 46 more tickets. say the No.of stations after and before added.

0 Answers   Infosys,

---

2,20,110,380,?

3 Answers  

---

---

Cities A and B presently have populations of 70,000 and 60,000, respectively. City A grows at the rate 4% per year, and B grows at the rate of 5% per year. After how much time will city B have a larger population than city A? Answer in number of years to 2 decimal places.

2 Answers  

---

A policeman buys some bunches of yellow bananas at 30 cents per bunch and red bananas 40 cents/bunch .He said if i have split the sum equally and bought bananas he would have got two more bunches find the amount he used it to buy bananas

3 Answers   Infosys,

---

Two candles of equal lengths and of different thickness are there. The thicker one will last of six hours. The thinner 2 hours less than the thicker one. Ramesh light the two candles at the same time. When he went to bed he saw the thicker one is twice the length of the thinner one. For how long did Ramesh lit two candles .

5 Answers   CMC,

---

body provide nda apptitude questions

1 Answers   NDS,

---

Find the next number in the series. 1, 0.5, 0.25, 0.125

0 Answers   BPCL Bharat Petroleum, Sonata,

---

In a arithmetic reason 10,9,60,90,70 and 66.. .whats the next number with conclusion

0 Answers   IBM,

---

There is a lucky draw held every day. If there is a winning number eg. 1876, then all possible numbers like 1867 ,1687,1768 etc are the numbers that match irrespective of the position of the digits. Thus all these numbers qualify fr the lucky draw prize. Assume there is no zero digit in any numbers. Write a program to show all the possible winning numbers if a "winningnumber" is passed as an argument to the function. i want a solution in c/c++ language

0 Answers   IBM, Nagarro,

---