Interested to Buy Any Domain ? << Click Here >> for more details...
There are 3 baskets of fruits with worng lables,one basket
has apple,another basket has orange,another has combination
of apple and orange,what is the least way of interchange
the lables.
- 15 Answers
- 28051 Views
- Cisco, Google, MBT, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / nagendra
i m agree with ans 3.
ans 3 is perfect..because all labels r incorrect initially.
| Is This Answer Correct ? | 1 Yes | 2 No |
Answer / ushnish ranjan chatterjee
one basket of apple,least possible way of interchange-1!
one basket of orange ,least possible way of interchange-1!
another has combination of apple nd orange,te least
possible way of interchange-3C2
the least possible way of interchange-1C1+1C1+3C2=5
| Is This Answer Correct ? | 1 Yes | 2 No |
Answer / mugeshprabhu p
First put the fruits to a suitable correct labled
baskets . This is the easy way to Interchange the lables.
| Is This Answer Correct ? | 8 Yes | 10 No |
Answer / guest
Apples to apples
Oranges to oranges
combination to Apples and oranges
| Is This Answer Correct ? | 1 Yes | 3 No |
Explain what is the benefit of using an enum rather than a #define constant?
What is difference between %d and %i in c?
In which header file is the null macro defined?
What is hashing in c language?
Here is alphabets : abcdefgh 1) how to reverse. as hgfedcba 2) after reversal, how to group them in a pair hg fe dc ba.
what is differnence b/w macro & functions
Differentiate between static and dynamic modeling.
Expand the following LKB BKL FFG
5. What kind of sorting is this: SORT (k,n) 1.[Loop on I Index] repeat thru step2 for i=1,2,........n-1 2.[For each pass,get small value] min=i; repeat for j=i+1 to N do { if K[j]<k[min] min=j; } temp=K[i];K[i]=K[min];K[min]=temp; 3.[Sorted Values will be returned] A)Bubble Sort B)Quick Sort C)Selection Sort D)Merge Sort
main() { printf("hello"); fork(); }
What is the use of gets and puts?
Write a C program in Fibonacci series.
C 
