Circumference of circle?
Answers were Sorted based on User's Feedback
In the 4 digits 1,2,3,4 how many 4 digited numbers are possible which are divisable by 4? Repetetions are allowed
If A, B and C are the mechanisms used separately to reduce the wastage of fuel by 30%, 20% and 10%. What will be the fuel economy if they were used combined.
Q1. Given a collection of points P in the plane, a 1-set is a point in P that can be separated from the rest by a line, .i.e the point lies on one side of the line while the others lie on the other side. The number of 1-sets of P is denoted by n1(P). The minimum value of n1(P) over all configurations P of 5 points in the plane in general position(.i.e no three points in P lie on a line) is
A works thrice as much as B. If A takes 60 days less than B to do a work then find the number of days it would take to complete the work if both work together?
0 Answers 3i Infotech, Canara Bank, EDS,
1/8 is devided by 's' , if 's' is incresed by 2 times, what is the result?
(root 200) - (root 50) =?
4 Answers Citicorp, COSL, Wipro,
There are 6 red shoes & 4 green shoes . If two of red shoes are drawn what is the probability of getting red shoes
4 Answers 3i Infotech, Canara Bank, CMC, Geodesic, Mu Sigma,
what is pH value of fertile soil ?
Complete the sequence 9,10,11,13,15, __, 21,28.
Given the length of the 3 sides of a triangle.Find the one that is impossible? (HINT : sum of smaller 2 sides is greater than the other one which is larger)
Find the longest palendrom in a string? Example Input: abfgerccdedccfgfer Output: ccdedcc i want a solution in C/C++ language
Alok and Bhanu play the following min-max game. Given the expression N = 9 + X + Y – Z where X, Y and Z are variables representing single digits (0 to 9), Alok would like to maximize N while Bhanu would like to minimize it. Towards this end, Alok chooses a single digit number and Bhanu substitutes this for a variable of her choice (X, Y or Z). Alok then chooses the next value and Bhanu, the variable to substitute the value. Finally Alok proposes the value for the remaining variable. Assuming both play to their optimal strategies, the value of N at the end of the game would be