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?
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 |
If a rook and a bishop of a standard chess set are randomly placed on a chessboard, what is the probability that one is attacking the other? Note that both are different colored pieces.
You have 8 coins. 3 of them weigh x units, 3 y units, 1 a units and 1 b units. They are all mixed and look identical. You have to find the lightest coin in minimum number of weighing (balance)
Outside a room there are three light switches. Each switch is connected to a different light bulb inside the room. Each of the three switches can be either 'ON' or 'OFF'. You are allowed to set each switch the way you want it, once, and then enter the room. Your task is to then determine which switch controls which bulb. How can you do it?
Mrs. F has invited several wives of delegates to the United Nations for an informal luncheon. She plans to seat her 9 guests ina row such that each lady will be able to converse with the person directly to her left and right. She has prepared the following list. Mrs. F speaks English only. Mrs. G speaks English and French. Mrs. H speaks English and Russian. Mrs. J speaks Russian only. Mrs. K speaks English only. Mrs. L speaks French only. Mrs. M speaks French and German. Mrs. N speaks English and German. Mrs. O speaks English only. How many distinct seating arrangements are possible? Give all possible seating arrangements. Note that ABCD and DCBA are the same.
At the Party: 1. There were 9 men and children. 2. There were 2 more women than children. 3. The number of different man-woman couples possible was 24. Note that if there were 7 men and 5 women, then there would have been 35 man-woman couples possible. Also, of the three groups - men, women and children - at the party: 4. There were 4 of one group. 5. There were 6 of one group. 6. There were 8 of one group. Exactly one of the above 6 statements is false. Can you tell which one is false? Also, how many men, women and children are there at the party?
why the students are lag for answering this type of questions?
Reshma is standing in front of her room.Ramu is coming from north towdars her and he can see his shadow falling on his right.In which direction she is standing?
Hi, this is das. i will attend bank of baroda 2008 clerical exam. i need model bank exam question papers. please send me. this is my mail id: thulasi.dasan@yahoo.co.in
There were N stations on a railroad. After adding X stations 46 additional tickets have to be printed. Find N and X.
agar aapse wo insaan i love you kahe jis se aap pyar nahi karte to aap uska bina dil dukhaye kya jawab doge?
suppose you build a tower interlocking cubes that is 99 cubes high. And suppose you have to paint each square on the tower. How many squares would you have to paint?
|3\3 9/9| ! 3["9"" ["39"" | \9/ | ¡ "9""]3 ""9"] YOU "" "" understand this Mssg!! Send
5 Answers Olive Builders, Satyam,