Comparing 2 goblins with each other costs 1 "goblin comparison". Assume that more than half of the given n goblins are truth tellers. Design an O(n) goblin comparison algorithm that will identify 1 truth teller.
Comparing 2 goblins with each other costs 1 "goblin comparison". Assume that more than half of the given n goblins are truth tellers. Design an O(n) goblin comparison algorithm that will identify 1 truth teller.
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Can someone help me understand this problem from my textbook?
![2. Honest Goblins are Easy to Find
At Hogwarts a new shipment of n goblins has arrived. To be of any use, a goblin must be completely truthful (never lies). Unfortunately, not all of the n
goblins in the shipment are truth tellers. Only some are truth-tellers, and some are deceivers. It is your task to design an algorithm to separate the truth-
teller goblins from the deceiver goblins. To do this, you have one tool available: You may combine any two goblins and have them state whether the other
goblin is a truth-teller or a deceiver. A truth-teller will always say correctly what the other goblin is, but a deceiver may lie (but also may sometimes tell the
truth to REALLY confuse you). For any two goblins that you test, the following can be concluded from the goblin responses:
Goblin A says
Goblin B says
Conclusion
B is a truth-teller
A is a truth-teller
both are truth-tellers or both are deceivers
B is a truth-teller
A is a deceiver
at least one is a deceiver
B is a deceiver
A is a truth-teller
at least one is a deceiver
B is a deceiver
A is a deceiver
at least one is a deceiver
Comparing 2 goblins with each other costs 1 "goblin comparison". Assume that more than half of the given n goblins are truth tellers. Design an O(n) goblin
comparison algorithm that will identify 1 truth teller.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F35fa430f-589e-4c96-94c6-b23ae2cbaf8e%2Ff5135612-b2ed-4641-814e-15205acee250%2Fqojx27s_processed.png&w=3840&q=75)
Transcribed Image Text:2. Honest Goblins are Easy to Find
At Hogwarts a new shipment of n goblins has arrived. To be of any use, a goblin must be completely truthful (never lies). Unfortunately, not all of the n
goblins in the shipment are truth tellers. Only some are truth-tellers, and some are deceivers. It is your task to design an algorithm to separate the truth-
teller goblins from the deceiver goblins. To do this, you have one tool available: You may combine any two goblins and have them state whether the other
goblin is a truth-teller or a deceiver. A truth-teller will always say correctly what the other goblin is, but a deceiver may lie (but also may sometimes tell the
truth to REALLY confuse you). For any two goblins that you test, the following can be concluded from the goblin responses:
Goblin A says
Goblin B says
Conclusion
B is a truth-teller
A is a truth-teller
both are truth-tellers or both are deceivers
B is a truth-teller
A is a deceiver
at least one is a deceiver
B is a deceiver
A is a truth-teller
at least one is a deceiver
B is a deceiver
A is a deceiver
at least one is a deceiver
Comparing 2 goblins with each other costs 1 "goblin comparison". Assume that more than half of the given n goblins are truth tellers. Design an O(n) goblin
comparison algorithm that will identify 1 truth teller.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Concepts of Database Management](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY