Answer / jograj singh

Let us assume, Mr. Haani sits in train on Monday. So he is
scheduled to reach on Thursday at 11:30 PM.

When the train starts from Mumbai, the first SlowRun express
which he crosses is the one which is scheduled to reach
Mumbai at 11:30 PM, that same day (monday) This train
started 3 days ago.. ie on Friday.

Now, on his way, he will cross the trains which started on
Saturday, Sunday and Monday + The trains which started from
Bangalore when Mr. Haani was himself in the train

That is... Trains started from bangalore on Tuesday,
Wednesday and Thursday.

In Total, he crosses 7 SlowRun Expresses.

Answer / prathyusha

I have been seeing the answer as 7 but unable to get it logically... can someone please exxplain it clearly???

Answer / guest

Mr. Haani crossed 7 SlowRun Expresses during his journey.

Let's say that Mr. Haani travelled by SlowRun Express on
Wednesday 10:00PM from Mumbai. The first train he would have
crossed is the one scheduled to arrive at Mumbai at 11:30 PM
the same day i.e. the one that left Bangalore at 10:00 PM on
last Sunday.

Also, he would have crossed the last train just before
reaching Bangalore on Saturday.

Thus, Mr. Haani must have crossed 7 SlowRun Expresses during
his journey.

Answer / sandeep yadav

BLORE T * 24 * t1 * 24 * t2 * 24 * t3 * 3/2 * MUMBAI

BLORE * 3/2 * t7 * 24 * t6 * 24 * t5 * 24 * t4 MUMBAI

Answer / sunil

it is seven times crossed.first time cross at mumbai and
same train at banglore station.
and five times in that three days.

A mule and a donkey were carrying full sacks on their backs. The mule started complaining that his load was too heavy. The donkey said to him "Why are you complaining? If you gave me one of your sacks I'd have double what you have and if I give you one of my sacks we'd have an even amount." How many sacks were each of them carrying? Give the minimal possible answer.

1 Answers  

Substitute digits for the letters to make the following Division true Y F Y ----------- A Y | N E L L Y | N L Y ---------------- P P L P N H ---------- N L Y N L Y ---------- 0 0 0 Note that the leftmost letter can't be zero in any word. Also, there must be a one-to-one mapping between digits and letters. e.g. if you substitute 3 for the letter N, no other letter can be 3 and all other N in the puzzle must be 3.

1 Answers  

i want model paper on SBI Clerk post,plz sed previous papers

0 Answers   State Bank Of India SBI,

Consider a chessboard with a single Rook. A Rook can move any number of square sideways/forward, but not diagonally. What is the minimum number of moves the Rook needs to make, in order to pass over all the squares on the chessboard and return to the original position?

5 Answers  

Its come one in a year and twice in a week. What is this?

10 Answers   Infosys,

A man got 30 aples in 1 Rs.Now he want 20% of profit on it. How many apples He should Sell in 1 Rs.??

20 Answers   TCS,

Suppose five bales of hay are weighed two at a time in all possible ways. The weights in pounds are 110, 112, 113, 114, 115, 116, 117, 118, 120, and 121. How much does each bale weigh?

1 Answers  

One sales man sold one box out of them and then he says, "I have the same number of red balls left out as that of blue." Which box is the one he solds out?

3 Answers  

A, B and C are three points on a straight line, not necessarily equidistant with B being between A and C. Three semicircles are drawn on the same side of the line with AB, BC and AC as the diameters. BD is perpendicular to the line ABC, and D lies on the semicircle AC. If the funny shaped diagram between the three semicircles has an area of 1000 square cms, find the length of BD.

1 Answers  

There are four groups of Mangoes, Apples and Bananas as follows: Group I : 1 Mango, 1 Apples and 1 Banana Group II : 1 Mango, 5 Apples and 7 Bananas Group III : 1 Mango, 7 Apples and 10 Bananas Group IV : 9 Mango, 23 Apples and 30 Bananas Group II costs Rs 300 and Group III costs Rs 390. Can you tell how much does Group I and Group IV cost?

1 Answers  

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

0 Answers   TCS,

In how many iterations can we find one coin that is heavier than the others out of 8 coins?and how ?please reply

6 Answers   Symphony,