123 Eng

Engineering the engineers™


Latest Jobs   Forum Map

 

engineering

Home
Source Codes
Engineering Colleges

Training  Reports
Seminar Reports
Placement Papers

Forums

Computer Science / IT
Electronics
Electrical
Mechanical
Chemical
Civil

CAT / MBA

GMAT / Foreign MBA
Latest Jobs

Engineering Jobs / Technical Jobs
Management Jobs

Sitemap
Terms of use


 
   

Job Placement Papers (All Companies)

 
Placement Papers>>

OnMobile Asia Placement Papers

 
OnMobile Sample Paper: 8/5/2005

1. if the date is written as MMDDYYYY, and then 10022001, ie)oct 2 2001 is a palindrome. which is the immediate palindrome before that date.

2. there r 2 trains travelling at 100 MPH each. there is a 200Mile tunnel. the trains travel in opposite directions. when the trains enter, a supersonic bee starts at the tunnel, touches the other train, comes back touches the first train, turns again and touches the other train and so on until the trains collide. Find the distance travelled by the bee.

3. It is 12.00 o clock. Find how often the minute hand meets the hour hand.

4. Find the maximum product using positive integers the sum of which is 100. Dont know if i am sure with this one. sorry. i didnt do this. 

5. in a train Art is found dead. hours later 4 people are queried,

Blonde says i am innocent, i didnt speak with Art
White says i am innocent, Blonde spoke with Art
Old says i am innocent, the brunette killed Art
Brunette says i am innocent, one of the men killed Art

The inspector says simple, 4 true statements, 4 false statements.
I know the killer, very simple!!!
Find out the killer. (only one is involved.)

6. 2 maths geniuses meet after 20 yrs.one says i am married. and have 3 daughters. the product of their ages is 72. the sum is the same as the house no. other says, but I cant find it out. The other says. . simple. ok, my eldest daughter has just started the piano classes.Find their ages.This one is there in previous question papers also.

7. 5 sea pirates have 100 gold coins and want to share it. They propose a plan. 
The senior most one has to propose an idea, if at least 50 % agree, the coins r shared accordingly. else the senior is killed and the next senior most is asked to present a plan and so on . 
note, all the guys r very clever and very greedy and dont want to lose the coins, and dont want to die. Form a way to share the money.
I didnt do this....no time


ANSWERS

1. the answer is 08 31 1380.
i worked it out like this.. before 2001, 2000 cannot be taken as MMDD becomes 0002.
also anything after 14 century cant be considered as 1401 would mean 1041, there r only a max of 31 days a month. so the century nos must be only 13(reverse for 31)so the yr is 13xx. now 1399to 1391 is not possible as reverse means 99 to 19 but max no of months is 12. so 1390 becomes 09311390... but 9th month has only 30 days(lucky i remembered it).. so 1380 is the most recent palindrome ... which beocomes 08311380.
SOln is 08 31 1380.

2. this one i really screwed up royally. it took me 25 minutes to solve.. i took the average speeds, the distance travelled by the trains and the bee, took ratio of speeds and distance, subtracting it from the tunnels length for every time the bee touched the trains. phew lot of calculation.. and got the ans as 1000.

But when i rechecked it a thought struck me... so silly of me. The trains collide at the middle. ie)after 100 miles. that means after 1 hour. so the bee travels for 1 hour touching each train till they collide. its speed being 1000 mph, it travelled a 1000 miles..
3. at 12.00 the minute and hour hand are together. but at 1.00 they are 5 mins apart. so in 60 minutes the gain is 55 mins for the min hand. to be together it has to gain another 5 more mins. so the time taken to gain 5 mins is 

60*5/55==5.454
So the time taken to meet again is 65.454
So the hands meet every 65.454 minutes

4. sorry no time to see this and dont remember it correctly.

5. the blonde killed

6. ?

7. ?
 

 

 

Contribute content or training reports / feedback / Comments
job placement papers
All rights reserved copyright 123ENG