Solved

A Computer Science/Math Algorithm Question

Posted on 2008-10-06
7
393 Views
Last Modified: 2008-10-15
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.
0
Comment
Question by:zxzwin
  • 3
  • 2
  • 2
7 Comments
 
LVL 84

Expert Comment

by:ozo
ID: 22656706
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
 

Author Comment

by:zxzwin
ID: 22656835
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
 

Accepted Solution

by:
zxzwin earned 0 total points
ID: 22656918
0
Back Up Your Microsoft Windows Server®

Back up all your Microsoft Windows Server – on-premises, in remote locations, in private and hybrid clouds. Your entire Windows Server will be backed up in one easy step with patented, block-level disk imaging. We achieve RTOs (recovery time objectives) as low as 15 seconds.

 
LVL 18

Expert Comment

by:deighton
ID: 22657728
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
 
LVL 84

Expert Comment

by:ozo
ID: 22664794
> 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
 
LVL 18

Expert Comment

by:deighton
ID: 22668408
>>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
 
LVL 84

Expert Comment

by:ozo
ID: 22668450
Or you can just assume it, as the question instructs.
0

Featured Post

Is Your AD Toolbox Looking More Like a Toybox?

Managing Active Directory can get complicated.  Often, the native tools for managing AD are just not up to the task.  The largest Active Directory installations in the world have relied on one tool to manage their day-to-day administration tasks: Hyena. Start your trial today.

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Suggested Solutions

Title # Comments Views Activity
Percentage 6 57
Revenue table 8 100
Math equations 13 50
ANOVA 3 7
How to Win a Jar of Candy Corn: A Scientific Approach! I love mathematics. If you love mathematics also, you may enjoy this tip on how to use math to win your own jar of candy corn and to impress your friends. As I said, I love math, but I gu…
Iteration: Iteration is repetition of a process. A student who goes to school repeats the process of going to school everyday until graduation. We go to grocery store at least once or twice a month to buy products. We repeat this process every mont…
This is a video describing the growing solar energy use in Utah. This is a topic that greatly interests me and so I decided to produce a video about it.
Although Jacob Bernoulli (1654-1705) has been credited as the creator of "Binomial Distribution Table", Gottfried Leibniz (1646-1716) did his dissertation on the subject in 1666; Leibniz you may recall is the co-inventor of "Calculus" and beat Isaac…

773 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question