Professor Diogenes has n supposedly identical VLSI chips that in principle are capable of testing each other. The professor's test jig accommodates two chips at a time. When the jig is loaded, each chip tests the other and reports whether it is good or bad. A good chip always reports accurately whether the other chip is good or bad, but the answer of a bad chip cannot be trusted. Thus, the four possible outcomes of a test are as follows:
(Chip A says B is good - Chip B says A is good – Conclusion both are good, or both are bad) (Chip A says B is good - Chip B says A is bad - Conclusion at least one is bad) (Chip A says B is bad - Chip B says A is good - Conclusion at least one is bad) (Chip A says B is bad - Chip B says A is bad - Conclusion at least one is bad) a)Show that if more than n/2 chips are bad, the professor cannot necessarily determine which chips are good using any strategy based on this kind of pair wise test. Assume that the bad chips can conspire to fool the professor. b)Consider the problem of finding a single good chip from among n chips, assuming that more than n/2 of the chips are good. Show that [n/2] pair wise tests are sufficient to reduce the problem to one of nearly half the size. c)Show that the good chips can be identified with tetta(n) pair wise tests, assuming that more than n/2 of the chips are good. Give and solve the recurrence that describes the number of tests. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
