Attribution Non-Commercial (BY-NC)

7 views

Attribution Non-Commercial (BY-NC)

- SOL Testexam
- New Approach to Modified Schur-Cohn Criterion for Stability Analysis of a Discrete Time System
- Master Theorem
- Navigation in a Small World
- Electronic Control System of Home Appliances Using Speech Command Words
- WH Science 11
- Gauss Jordan Method for Solving Systems of Linear Equations
- MC0079 Fall Drive Assignment 2012
- t039 - A New Genetic Algorithm for Optimal Routes Generation in Public Transport Network
- Sistema de Velocidad-diesel
- Cormen Contents 1stEdition
- jbptunikompp-gdl-chandradar-33573-5-10.unik-a.pdf
- Dd Revision2 2004
- Gaussian Quadrature Weights and Abscissae
- Notes 17
- CBar
- Bound Energy Alg Exercise With Solutions
- article.pdf
- platerecognition-matlab.txt
- FEM

You are on page 1of 2

The FBI has surrounded the headquarters of the Norne corporation. There are n people in the building. Each person is either an engineer or a manager. All computer files have been deleted, and all documents have been shredded by the managers. The problem confronting the FBI interrogation team is to separate the people into these two classes, so that all the managers can be locked up and all the engineers can be freed. Each of the n people knows the status of all the others. The interrogation consists entirely of asking person i if person j is an engineer or a manager. The engineers always tell the truth. What makes it hard is that the managers may not tell the truth. In fact, the managers are evil geniuses who are conspiring to confuse the interrogators. 1. Under the assumption that more than half of the people are engineers, can you find a strategy for the FBI to find one engineer with at most n-1 questions? 2. Is this possible in any number of questions if half the people are managers? 3. Once an engineer is found, he/she can classify everybody else. Is there a way to classify everybody in fewer questions?

Solution

Part 1: A correct, optimal, and elegant solution was submitted by Chris Peikert, Grant Wang, and Abhi Shelat of MIT. A number of others submitted partial solutions. Here's an n-1 query solution to part 1. Maintain three sets of people: UNSEEN, STACK, and DISCARD. Initialize the process by picking one arbitrarily to be the STACK, everything else is UNSEEN. Repeat the following step until UNSEEN is empty: Pick an UNSEEN element x, remove it from UNSEEN. Ask the top of the STACK y about x. If y says "manager" pop y off the stack and DISCARD both x and y. If it says "engineer" add x to the top of the STACK. After all elements have been processed in this way (n-1 comparisons), the top of the stack must be an engineer. Why does this work? First observe that whenever we discard a pair, at least one of them is a manager. So among the rest of them (STACK and UNSEEN) a majority must still be engineers. So at the end, when UNSEEN is empty, there must be an engineer in the stack, therefore the top of the stack must be an engineer. This can be improved to n-2 simply by stopping one earlier. When there's one UNSEEN left, if the stack is empty, that UNSEEN one is an engineer. Otherwise, the top of the stack must be an engineer. If is n is even and n>=4, as a first step we can just throw out one person, and appy this algorithm to the remaining n-1 obtaining n-3 comparisons. This gives the optimal algorithm. This is optimal. The proof appears in the solution of homework assignment 7 of Steven Rudich's course 15-251 taught at CMU in the spring semester of 2002. See Solution 7. Part 2: If half or more of the people are managers, then the problem cannot be solved. The managers can ensure this simply by always lying. Now there's way to separate the two sets of people. Each one simply claims the others are Managers.

Part 3: I don't know any better solution than to simply using the solution to Part 1 to identify everybody.

- SOL TestexamUploaded byAdam Skibsted
- New Approach to Modified Schur-Cohn Criterion for Stability Analysis of a Discrete Time SystemUploaded byRitesh Keshri
- Master TheoremUploaded bymadhuyadav
- Navigation in a Small WorldUploaded byapi-26490800
- Electronic Control System of Home Appliances Using Speech Command WordsUploaded byIJSTR Research Publication
- WH Science 11Uploaded byAnonymous 1gbsuaafdd
- Gauss Jordan Method for Solving Systems of Linear EquationsUploaded byciki1
- MC0079 Fall Drive Assignment 2012Uploaded bySneha Latha
- t039 - A New Genetic Algorithm for Optimal Routes Generation in Public Transport NetworkUploaded byikhsan854n
- Sistema de Velocidad-dieselUploaded byMarcos
- Cormen Contents 1stEditionUploaded byFernando Tapia
- jbptunikompp-gdl-chandradar-33573-5-10.unik-a.pdfUploaded byAbi Guitara
- Dd Revision2 2004Uploaded byPavika Sharma
- Gaussian Quadrature Weights and AbscissaeUploaded byapmapm
- Notes 17Uploaded bysavio77
- CBarUploaded by007wasr
- Bound Energy Alg Exercise With SolutionsUploaded byfatima_akram
- article.pdfUploaded byErcherio Marpaung
- platerecognition-matlab.txtUploaded byRa'ad Elias Shomaly
- FEMUploaded byFatima Ahmed
- Dr. Dileep AssignmentUploaded byDileep Singh
- CS F213 RL 8.4Uploaded bySAURABH MITTAL
- LabUploaded byAliyan Razzaq
- Cluster AnalysisUploaded byAshirbad Nayak
- 483-2011-polynomials--special products--explanation practiceUploaded byapi-258903855
- 1Uploaded byphaneendra
- Alcatel Power Control in B6Uploaded byMehmet Cetin
- Heterogeneous Multiprocessor Task Scheduling Using Genetic and Simulated Annealing Algorithms and Their HybridizationUploaded byTJPRC Publications
- Bipolar Neutrosophic Graph StructuresUploaded byMia Amalia
- rombergUploaded by96nissan

- BIOE120 Exam Two Review.docxUploaded byCraig Hocking
- Anesthetic Management of Patients With Major Burn InjuryUploaded byPablo Eduardo Amador
- at2 - report no audioUploaded byapi-322638833
- 22. Landers Oral Bacteria_ How Many_ How Fast_ - Registered Dental HygienistUploaded byEllizabeth Lilanti
- pm9sb 128Uploaded byapi-237494396
- Treatment of Vernal Keratoconjunctivitis Comparison Between Topical CyclosporineUploaded byVerdi
- Sumati's QuestionUploaded byire
- Some Say That Your Teacher is in Loco Parentis to a StudentUploaded byClaire
- MIMO channel capacityUploaded byriazgurguri
- Lens AnatomyUploaded byvirliefatra
- BMUUploaded byAbel Abera
- lesson planUploaded byapi-282628079
- NIST Fingerprint Testing StandardsUploaded byCash Cash Cash
- MA1022_TUTORIAL_3_4_2010Uploaded byNuwan Bandara
- Orange County Children's Book FestivalUploaded byRobyn Hawk
- QAR LessonUploaded bySami Richmond
- Consumer Durable ProjectsUploaded byKing Krish
- Evidence-of-Evolution-Answer-Key.docxUploaded byMagda P
- United States v. Honorable Jack B. Weinstein, United States District Judge for the Eastern District of New York, United States of America v. Albert Grunberger, 452 F.2d 704, 2d Cir. (1971)Uploaded byScribd Government Docs
- Use of English May.docxUploaded byVirginia Balufo Moreno
- alternative medicine - seiroganUploaded byapi-298282626
- Vencilao vs VanoUploaded byMikey Go
- bronkiektasisUploaded byirena
- LMP 29Uploaded byGeev Mokryani
- lda+UUploaded bySara Postorino
- Warlock of the Magus World - Book 08.epubUploaded bynewtype
- DIRECTION OF CUREUploaded byHomoeopathic Pulse
- City Builder Volume 9 (Hi-res September 16)Uploaded byHeath Wannemacher
- Grammar Booster UNIT 4Uploaded byLizCaroliina
- Smex1045 Strength of Materials 2 1 0 3[1]-1Uploaded bysankarsuper83