A Computer Science/Math Algorithm Question

Calling all Math and CS Theory wizards, here's an algorithm question that I need help with. This would require use of recurrence and divide and conquer strategy:

There are n supposedly identical VLSI chips that in principle are capable of testing each other. 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  Chip B says     Conclusion
B is good       A is good          both are good, or both are bad
B is good       A is bad            at least one is bad
B is bad         A is good          at least one is bad
B is bad         A is bad            at least one is bad

a. Show that if more than n/2 chips are bad, we cannot necessarily determine which chips are good using any strategy based on this kind of pairwise test. Assume that the bad chips can conspire to fool the the tester.


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 floor(n/2) pairwise tests are sufficient to reduce the problem to one of nearly half the size.


c. Show that the good chips can be identified with Theta(n) pairwise tests, assuming that more than n/2 of the chips are good. Give and solve the recurrence that describes the number of tests.
zxzwinAsked:
Who is Participating?

[Webinar] Streamline your web hosting managementRegister Today

x
 
zxzwinConnect With a Mentor Author Commented:
0
 
ozoCommented:
if more than n/2 chips are bad. a possible outcome is all bad chips report other bad chips as good, and good chips as bad
this is indistinguishable from the result if all the bad were good and all the good were bad.
0
 
zxzwinAuthor Commented:
Hmm, ok. I think a) is easier to understand conceptually. But parts b and c require more rigorous math, which is what I'm stuck on... Any more help on those parts are appreciated! Thanks in advance.
0
Free Tool: SSL Checker

Scans your site and returns information about your SSL implementation and certificate. Helpful for debugging and validating your SSL configuration.

One of a set of tools we are providing to everyone as a way of saying thank you for being a part of the community.

 
deightonCommented:
I don't understand, if they are all good then you get nothing but good readings, if they are all bad then you may also get nothing but good readings, so how can you be sure you have the first case and not the second?


0
 
ozoCommented:
> how can you be sure you have the first case and not the second?
If you know that more than n/2 of the chips are good, it rules out the second case.
If you know that more than n/2 chips are bad, it rules out the first case.
0
 
deightonCommented:
>>If you know that more than n/2 of the chips are good, it rules out the second case.

but then they've been tested by some other means in the first place in order to know that.  
0
 
ozoCommented:
Or you can just assume it, as the question instructs.
0
All Courses

From novice to tech pro — start learning today.