One of eight coins is counterfeit and is either too heavy or too light. The problem is
Chapter 6, Problem 20(choose chapter or problem)
One of eight coins is counterfeit and is either too heavy or too light. The problem is to identify the counterfeit coin and determine whether it is heavy or light. a. What is the number of final outcomes (the number of leaves in the decision tree)? b. Find a lower bound on the number of comparisons required to solve this problem in the worst case. c. Devise an algorithm that meets this lower bound (draw its decision tree).
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer