Basically I have 2 lab assignments (which takes a total of 45 minutes to complete) and they have comments indicating where to write your code (it even gives you hints). I'm only accepting a bid that is equal to $25. This should be a quick and easy assignment.

The directions for the 2 labs, Lab #11 & Lab #12, are in seperate .PDF files. Please put the code in the .java files given. So it's just prewritten code and all you do is fill in; pretty easy.

```
(You don't write code for this one but basically a paragraph/algorithm on how you come about to do this): 10 precious points towards your homework
You can write/describe your algorithm on a page and give it to me before class
starts.
Description of the problem:
Assume that Mr. Hoang has invented "magic water" giving the person
who drinks just a drop the ability to receive 100% on a final exam ("pure
luck").
Due to his quick aging, he has produced only 1 prototype bottle after more
than 2 decades.
In order to protect his precious bottle from being identified easily and
stolen,
he decided to buy 999 bottles of mineral water and put all 1000 bottles
together in his office.
Nonetheless, during his vacation, his friend went in and removed all labels
from the bottles.
When Mr. Hoang came back, he realized that his magic bottle has to be 1 of the
1000 bottles that look the same now.
He only has 10 students who are willing to help him find the bottle.
The only final exam for them to do this week is the CS final exam administered
by Mr. Unknown this afternoon, which takes 5 days to grade and return the
score.
However, Mr. Hoang needs the bottle in precisely 7 days so he can take his
final exam! How can he find the real magic bottle?
(Assume that no one can get 100% on the final exam without drinking the "magic
water"! (Actually , this may be a tautology!) ). His 10 students can only
take the test afternoon. There are no other exams available for them to take!
```

Subject | Computer |

Due By (Pacific Time) | 04/26/2014 12:00 am |

Tutor | Rating |
---|---|

pallavi Chat Now! |
out of 1971 reviews More.. |

amosmm Chat Now! |
out of 766 reviews More.. |

PhyzKyd Chat Now! |
out of 1164 reviews More.. |

rajdeep77 Chat Now! |
out of 721 reviews More.. |

sctys Chat Now! |
out of 1600 reviews More.. |

sharadgreen Chat Now! |
out of 770 reviews More.. |

topnotcher Chat Now! |
out of 766 reviews More.. |

XXXIAO Chat Now! |
out of 680 reviews More.. |