Interested to Buy Any Domain ? << Click Here >> for more details...
There are 8 billiard balls, and one of them is slightly
heavier, but the only way to tell was by putting it on a
weighing scale against another. What's the fewest number of
times you'd have to use the scale to find the heavier ball?
- 5 Answers
- 9177 Views
- Microsoft, TCS, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / mahesh t
first take 6 balls from 8 balls
from those 6 divide 3 and 3 check it in weighing scale if it
equals weight remaining 2 balls and you get the hevier
ball....of not equals take the 3 balls which is hevier from
those weighing with 6 balls then take 2 balls from those 3
balls and weight if equals the remaining one is hevier
and final you can know the hevier ball within 2 times
| Is This Answer Correct ? | 8 Yes | 0 No |
regarding pointers concept
int a[3][5]={ {1,2,3,4,5],{2,3,4,5,6},{10,11,12,13,14}}; int *p=&a; printf(“%d”,*(*(x+1)+3));
What is nested structure in c?
What is a segmentation fault?
Explain in detail how strset (string handling function works )pls explain it with an example.
What are the uses of pre-processor directives?
What is a void pointer? When is a void pointer used?
yogesh patil in dell
Write a C/C++ program that connects to a MySQL server and checks intrusion attempts every 5 minutes. If an intrusion attempt is detected beep the internal speaker to alert the administrator. A high number of aborted connects to MySQL at a point in time may be used as a basis of an intrusion.
2 Answers Drona Solutions, Infosys, Vodafone, Webyog,
Give me the code of in-order recursive and non-recursive.
What is the output of the below program and how it is? void main() { static int var=5; printf("%d",var--); if(var) main(); }
8 Answers MindFire, TCS, Tech Mahindra,
There is a number and when the last digit is moved to its first position the resultant number will be 50% higher than the original number.Find the number?
C 
