Go Premium for a chance to win a PS4. Enter to Win

x
?
Solved

A Computer Science/Math Algorithm Question

Posted on 2008-10-06
7
Medium Priority
?
420 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 85

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
Industry Leaders: We Want Your Opinion!

We value your feedback.

Take our survey and automatically be enter to win anyone of the following:
Yeti Cooler, Amazon eGift Card, and Movie eGift Card!

 
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 85

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 85

Expert Comment

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

Featured Post

New feature and membership benefit!

New feature! Upgrade and increase expert visibility of your issues with Priority Questions.

Question has a verified solution.

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

Okay. So what exactly is the problem here? How often have we come across situations where we need to know if two strings are 'similar' but not necessarily the same? I have, plenty of times. Until recently, I thought any functionality like that wo…
Have you ever thought of installing a power system that generates solar electricity to power your house? Some may say yes, while others may tell me no. But have you noticed that people around you are now considering installing such systems in their …
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.
I've attached the XLSM Excel spreadsheet I used in the video and also text files containing the macros used below. https://filedb.experts-exchange.com/incoming/2017/03_w12/1151775/Permutations.txt https://filedb.experts-exchange.com/incoming/201…
Suggested Courses

876 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