Interested to Buy Any Domain ? << Click Here >> for more details...
There are N secret agents each know a different piece of
secret information. They can telephone each other and
exchange all the information they know. After the telephone
call, they both know anything that either of them knew
before the call.
What are the minimum number of telephone calls needed so
that all of the them know everything?
- 8 Answers
- 19374 Views
- Microsoft, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / guest
(2N - 3) telephone calls, for N = 2,3
(2N - 4) telephone calls, for N > 3
Divide the N secret agents into two groups. If N is odd, one
group will contain one extra agent.
Consider first group: agent 1 will call up agent 2, agent 2
will call up agent 3 and so on. Similarly in second group,
agent 1 will call up agent 2, agent 2 will call up agent 3
and so on. After (N - 2) calls, two agents in each the group
will know anything that anyone knew in his group, say they
are Y1 & Y2 from group 1 and Z1 & Z2 from group 2.
Now, Y1 will call up Z1 and Y2 will call up Z2. Hence, in
next two calls total of 4 agents will know everything.
Now (N - 4) telephone calls are reqiured for remaining (N -
4) secret agents.
Total telephone calls require are
= (N - 2) + 2 + (N - 4)
= 2N - 4
Let\'s take an example. Say there are 4 secret agents W, X,
Y & Z. Divide them into two groups of 2 each i.e. (W, X) and
(Y, Z). Here, 4 telephone calls are required.
1. W will call up X.
2. Y will call up Z.
3. W, who knows WX will call up Y, who knows YZ.
4. X, who knows WX will call up Z, who knows YZ.
Take an another example. Say there are 5 secret agents J, K,
L, M & N. Divide them into two groups i.e. (J, K) and (L, M,
N). Here, 6 telephone calls are required.
1. J will call up K.
2. L will call up M.
3. M will call up N. Now M and N know LMN.
4. J, who knows JK will call up M, who knows LMN.
5. K, who knows JK will call up N, who knows LMN.
6. L will call up to anyone of four.
| Is This Answer Correct ? | 22 Yes | 10 No |
Answer / m.n.prakash
N-1
EX:
take N=4 then.....
N1 call to N2,N3,N4.so N1 can know information from those
three.then N2 call N3,N4 and know info from both.finally
N3 call to N4 and know the info from N4.so totally need the
only 4 calls to know each others.
so i can that only they need 4 phone calls.
| Is This Answer Correct ? | 6 Yes | 7 No |
Answer / max
The minimum number of calls required are: (n-1)+(n-2) = 2n-3
First agent needs to call n-1 agents to get all the
information. At the end of his last call i.e. (n-1)'th call,
the first and the n'th agent know all the information.
Now, if the first agent calls the remaining (n-2) agents,
all the information is shared between all agents.
It would not matter if the number of agents were even or odd.
| Is This Answer Correct ? | 0 Yes | 1 No |
Answer / manish kumar verma
a--->b = a calls to b
let say n peoples are {n1,n2,n3....nN}
step 1:n1--->n2 , n3-->n4 , n5-->n6....
step 2:n1-->n3, n5-->n7, n9-->n11 ..
step 3:n1-->n5, n9-->n13...
.
.
.
so on.
So in total minimum n-1 calls in both n even or odd..
| Is This Answer Correct ? | 3 Yes | 5 No |
Answer / abhinay
if we suppose n=2
then minimum 1 call is needed to share the message to each
other.
if n=3 then 2+1 call
if n=4 then 3+2+1 call
similarly for N=n then (n-1)+(n-2)+(n-3)+.........+1 call
needed to share the message to each other
| Is This Answer Correct ? | 2 Yes | 6 No |
Nine plates of similar in design... same colour, same size but one plate among that has very small difference in weight. you should find it but the condition is u can use weighing pan only two times. at the second time u should be able to find the defeated plate..............
Four persons A, B, C and D are playing cards.Each person has one card, laid down on the table below him, which has two different colours on either side. The colours visible on the table are Red, Green, Red and Blue. They see the color on the reverse side and give the following
4 Answers HP, Infosys, TCS, Wipro,
There are 10 statements written on a piece of paper: 1. At least one of statements 9 and 10 is true. 2. This either is the first true or the first false statement. 3. There are three consecutive statements, which are false. 4. The difference between the numbers of the last true and the first true statement divides the number, that is to be found. 5. The sum of the numbers of the true statements is the number, that is to be found. 6. This is not the last true statement. 7. The number of each true statement divides the number, that is to be found. 8. The number that is to be found is the percentage of true statements. 9. The number of divisors of the number, that is to be found, (apart from 1 and itself) is greater than the sum of the numbers of the true statements. 10. There are no three consecutive true statements. Find the minimal possible number?
what three specific job positions do you target from qatar airways group u.k?
there is a desert. a professor has to cross it n it takes 6days for him to cross. there are enough food reserves and students who can help d professor cross d desert. each person including professor can carry only 4 food packets with him while crossing the desert. in d desert also, each person can hav at the most 4 packets with him and they need to eat one packet per person per day during their travel. how wil d professor reach the other side of desert??
3 boys ,a,b,c . have 3 chocklets .. a ate the chocklet.b thrown away the chocklet and c ate half chocklet .now how many choclect each have in their hand.
Three boxes labeled as red, blue and mixed.These labels are incorrect.one box contains red balls and another box contains blue balls and remaining one box contains both red and blue balls. Pickup one ball from any box(u should pickup ball only once) and name the correct labels.
7 Answers 3D PLM, Exilant, IBM, NDS, Oracle, SofTech, Sports Keeda, The Advisory Board Company, Zycus Infotech,
One light light flashes 3 times in a minute and an another light flases 3 times in 2 minutes.Find the duration after which both lights will flash same number of times.
Arrange these words into a romantic word D P G E O D S?
arrange these alphabets evenymroin in to three words
Given the following facts: 1. Dinesh is younger than Farukh and older than Gurmit. 2. Jatin is younger than Chandu and older than Eshrat. 3. Amit is younger than Irfan and older than Chandu. 4. Farukh is younger than Bhavin and older than Hemant. 5. Irfan is younger than Gurmit and older than Jatin. 6. Hemant is older than Gurmit. Who is the Youngest?
Substitute digits for the letters to make the following subtraction problem true. S A N T A - C L A U S ----------------- X M A S Note that the leftmost letter can't be zero in any word. Also, there must be a one-to-one mapping between digits and letters. e.g. if you substitute 3 for the letter M, no other letter can be 3 and all other M in the puzzle must be 3.
English 
