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
- 19480 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 |
Consider the sum: ABC + DEF + GHI = JJJ If different letters represent different digits, and there are no leading zeros, what does J represent?
Somebody marked the six faces of a die with the numbers 1, 2 and 3 - each number twice. The die was put on a table. Four people - Abu, Babu, Calu and Dabu - sat around the table so that each one was able to see only three sides of the die at a glance. ? Abu sees the number 1 and two even numbers. ? Babu and Calu can see three different numbers each. ? Dabu sees number 2 twice and he can't remember the third number. What number is face down on the table?
Mark ate half of a pizza on Monday. He ate half of what was left on Tuesday and so on. He followed this pattern for one week. How much of the pizza would he have eaten during the week?
5 Answers Jindal Steel and Power,
There are 25 horses and five tracks. There is no stop clock and we have to find the top 5 horses in the bunch. What is the minimum possible races ?
wo konsi chiz hai jo adi honay k bad b puri he rehti hai, or agr khatam b ho jae tab b puri he rehti hai. what is this?
What is the remainder left after dividing 1! + 2! + 3! + ? + 100! By 7?
In training for a competition, you find that swimming downstream (with the current) in a river, you can swim 2 miles in 40 minutes, & upstream (against the current), you can swim 2 miles in 60 minutes. How long would it take you to swim a mile in still water?
In a certain game, if 2 wixsomes are worth 3 changs, and 4 changs are worth 1 plut, then 6 plutes are worth how many wixsomes?
Consider a number 235, where last digit is the sum of first two digits i.e. 2 + 3 = 5. How many such 3-digit numbers are there?
A man has Ten Horses and nine stables as shown here. [] [] [] [] [] [] [] [] [] The man wants to fit Ten Horses into nine stables. How can he fit Ten horses into nine stables?
if 12+22=24 23+8=6 32+13=40 73+16=144 then 36+2=?
Dr. DoLittle always goes walking to the clinic and takes the same time while going and while coming back. One day he noticed something. When he left the home, the hour hand and the minute hand were exactly opposite to each other and when he reached the clinic, they were together. Similarly, when he left the clinic, the hour hand and the minute hand were together and when he reached the home, they were exactly opposite to each other. How much time does Dr. DoLittle take to reach home from the clinic? Give the minimal possible answer.
English 
