Latest TCS Aptitude Question SOLUTION: A secret message is divided into Θ parts and each part is shared with a different person. People communicate with each other using two-way phone calls and, in each communication,

• Placement Papers
• /
• TCS

TCS Question Papers: TCS Interview Experience(90) TCS Company Profile

(#M40013651) TCS question Keep an EYE

A secret message is divided into Θ parts and each part is shared with a different
person. People communicate with each other using two-way phone calls and, in each
communication, share all the information they know until that point. What is the minimum
number of communications required for all Θ of them to know the secret? Find a
sequence of communications that achieves this minimum.

Asked In TCS gauthami (11 years ago)

Unsolved Read Solution (2)

Is this Puzzle helpful?   (10)   (2) Submit Your Solution

Read Solution (2) :

ashfaque ahmed  (11 years ago)

The Minimum no. of communications required = (2I-3)

Visit all the adjacent nodes starting from Node 1 in a circular queue traversal.
count visit from node 'N' to node 'N+1' as 1 and go on traversing till count (2I-3).

Is this solution Helpfull? Yes (15) | No (1)  

abhinav  (11 years ago)

A,B,C,D,E,F,G and H are the people as per condition

if Θ=0 then communications =0
if Θ=1 then communications =0
if Θ=2 then communications =1 - AB
if Θ=3 then communications =3 - AB BC AC
if Θ=4 then communications =4 - AB CD CB AD
if Θ=5 then communications =6 - AB DE AC CD AE CB
if Θ=6 then communications =8 - AB CD EF AC BE AF BD CE
if Θ=7 then communications =10-AB CD EF AC GE AE BG CB DG FG
if Θ=8 then communications =12-AB CD EF GH AC FH AF CH BE DG BD EG

Is this solution Helpfull? Yes (4) | No (4)  

Please Login to Read Solution.