1. Math
  2. Advanced Math
  3. hi im needing help with not only the answers but...

Question: hi im needing help with not only the answers but...

Question details
Hi, I’m needing help with not only the answers, but also the how and why you got to those answers! Thank you
Socrates the Scientific Squirrel is conducting some experi ments. Socrates lives in a very tall tree with n branches, and she wants to find out what is the lowest branch i so that an acorn will break open when dropped from branch i. (If an acorn breaks open when dropped from branch i, then an acorn will also break open when dropped from branch j for any j i.) The catch is that, once an acorn is broken open, Socrates will eat it immediately and it cant be dropped again.
a) Suppose that Socrates has two acorns. Give a procedure so that she can identify the correct branch using O(Vn) drops. We are expecting: Pseudocode AND a short English description of your algorithm, and a justification of the number of drops. If it helps you may assume that n is a perfect square.] b) Suppose that Socrates has k O(1) acorns. Give a procedure so that she can identify the correct branch using O(n/k) drops We are expecting: Pseudocode AND a short English description of your algorithm, and a justification of the number of drops. If it helps you many assume that n is of the form n m for some integer m.] C) What happens to your algorithm in part (d) when k [log(n)1? Is it O(log(n)), like in part (a)? Is it O(n1/) when k [log(n)+1, like in part (d)? We are expecting: A sentence of the form the number of drops of my algorithm in part (d) when k [log(n) +1 is (, along with justification. Also, two yes/no answers to the two yes/no questions (you should justify your answers but do not need to include a formal proof). I d) k acorns, for k ()? Either give a proof that she cant do better, or give an algorithm with asymptotically fewer drops. Is e(n1/k) drops is the best that Socrates can do with
Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution