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
- 19027 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 |
P pages read in d mins after day p+1 pages read in d+1 mins last day 379 pages done in 317 mins find p+4
sir i need generalKnowledge previous questions for rrb secunderabad goods guard exam
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?
if (x-a) power(degree) is 1 and (x-a)(x-b) power is 2 then (x-a)(x-b).........upto ...(x-z) power(degree) is how much?
9 Answers BA Continnum Solutions, HCL, Wipro,
Last Saturday Milan went for the late night show and came late. In the morning family members asked him which movie did he see. He gave different answers to everyone. ? He told to his father that he had gone to see MONEY. ? According to his mom, he saw either JOHNY or BABLU. ? His elder brother came to know that he saw BHABI. ? To his sister, he told ROBOT. ? And his grandpa heard that he saw BUNNY. Thus, Milan gave six movie names, all five letter words. But he saw some other movie with five letter word. Moreover, each of the six movie names mentioned above has exactly two letters common with the movie he saw. (with the same positions) Can you tell which movie did Milan see?
X is a 6 letter word 1 2 and 5 6 letters are the same 3 4 is a day 1 2 5 6 is go away 1 2 3 6 is fat and X is an international celebrity .. What is X ?
Veeru says to Jay, "Can you figure out how many Eggs I have in my bucket?" He gives 3 clues to Jay: If the number of Eggs I have 1. is a multiple of 5, it is a number between 1 and 19 2. is not a multiple of 8, it is a number between 20 and 29 3. is not a multiple of 10, it is a number between 30 and 39 How many Eggs does Veeru have in his bucket?
what job position/s are you currently holding with your current employer?
Three friends divided some bullets equally. After all of them shot 4 bullets the total number of bullets remaining is equal to the bullets each had after division. Find the original number divided.
8. Given a collection of points P in the plane , a 1-set is a point in P that can be separated from the rest by a line, .i.e the point lies on one side of the line while the others lie on the other side. The number of 1-sets of P is denoted by n1(P). The minimum value of n1(P) over all configurations P of 5 points in the plane in general position (.i.e no three points in P lie on a line) is a) 3 b) 5 c) 2
Find the least number which when divided by 35, leaves remainder 25; when divided by 45, leaves remainder 35 and when divided by 55, leaves remainder 45.
X is a five letter word.X is a talent in u.if u remove 1st letter X is dead. if u remove 1st 2 letters x is sick.what is X?
English 
