Answer Posted / mathsskumar_sarma2000

remeber following rules

1)no of monkeys are inversely proprtional to time,that is
no of minutes
2)and number of bananas are directly proprtional to time.

so 1 monkey----1 banana----3 min implies
10 monkeys---1 banana-----0.3 minutes(that is 3/10)

10 monkeys--10 bananas---3 min(that is 0.3 *10)

so nas is 3 min

there is a safe with a 5 digit No. The 4th digit is 4 greater than second digit, while 3rd digit is 3 less than 2nd digit. The 1st digit is thrice the last digit. There are 3 pairs whose sum is 11. Find the number.

1314

---

4 men can cross a bridge in 3,7,13, 17 minutes. Only two can cross the bridge at a time. The time taken by the two to cross the bridge is equal to the time taken by the slowest person of the two. Find the minimum time to all of them cross the bridge?

1390

---

A is driving on a highway when the police fines him for over speeding and exceeding the limit by 10 km/hr.same time B is fined for over speeding by twice the amount by which A exceeded the limit.If he was driving at km/hr what is the speed limit for the road?

1772

---

There are 4 numbers as 5,8,2,1 Form 4, four digit numbers as A, B and find the sum?

1342

---

Number of digits with a 2 in them between 100 and 400?

1239

---

If 13 = 13w/(1-w) ,then (2w)2 = ?

1310

---

he hour hand lies between 3 and 4. Tthe difference between hour and minute hand is 50 degree.What are the two possible timings?

1414

---

Two candles of equal lengths and diff thickness are there. The thicker one last 6 hrs ,the thinner 2 hrs less than thicker .Ramesh lit the two candle at same time , when he went to bed he saw that thicker one is twice the length of thinner one. For how long Ramesh lit the candles.

1267

---

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

2439

---

Find the next letter in the series O,T,T,F,F,S,S--

1173

---

15 software functions are there. It is known that atleast 5 of the m are defective. What is the probability that if three functions are chosen and tested, no errors are uncovered.

1342

---

Find the total number of squares in 1/4 of chess board ?

1206

---

If P=Total number of components, Q = number of defective components .What is the % of non defective components?

1297

---

What is the difference between control module

1789

---

When DB2 is run in IMS environment an application can access data in a) Only DB2 database b) Only IMS database c) Both DB2 & IMS databases d) None of the above

2508

---