Minimum phone calls for secret exchange
CAT 2005 Slot 1 · Quantitative Ability · Hard · Logical Reasoning
This is a hard Quantitative Ability question from the CAT 2005 Slot 1 paper. It tests Logical Reasoning. The full answer key and a step-by-step explanation are below — try it yourself first, then reveal the solution.
Three Englishmen and three Frenchmen work for the same company. Each of them knows a secret not known to others. They need to exchange these secrets over person-to-person phone calls so that eventually each person knows all six secrets. None of the Frenchmen knows English, and only one Englishman knows French. What is the minimum number of phone calls needed for the above purpose?
- A.
5
- B.
10
- C.
9
- D.
15
C
Explanation
Let Frenchmen be and Englishmen be , where knows French. Round 1 (Gathering secrets to ):
- calls (2 secrets)
- calls (3 secrets)
- calls ( gets all 3 French secrets)
- calls (2 secrets)
- calls ( gets all 6 secrets) Calls used .
Round 2 (Distributing secrets from ): 6. calls ( gets all 6) 7. calls ( gets all 6) 8. calls ( gets all 6) 9. calls , calls / etc. Minimum total calls required .
Related Logical Reasoning questions
- #1107NIM Admission Offers and Educational BackgroundsCATDILRMCQMedium
- #1108Initial and Final Cash Positions of Five BoysCATDILRMCQHard
- #1175Syllogism: Knowledge WorkersCATDILRMCQEasy
- #1176Syllogism: Traffic CongestionCATDILRMCQEasy
- #1185Beauty Contest Seating and Saree PuzzleCATDILRSET · 4QMedium
- #1188Round-Robin Tournament Scoring LogicCATQAMCQMedium
- #1233Four Sisters Money GameCATDILRSET · 4QHard
- #1256Kya-Kya Island Questioning LogicCATDILRSET · 3QHard
Practise this under exam conditions
Sign in to solve it with a live timer, the on-screen CAT calculator, and streak and accuracy tracking across every question you attempt.
Solve in the workspace