start with N bytes..
because each computer is connected to every other computer
transfer 1st byte to computer 1
transfer 2nd byte to computer 2
transfer 3rd byte to computer 3
transfer 4th byte to computer 4
.
.
.
transfer N byte to computer N
now computer 2 can open say x port and read 1st,3rd,4th,5th...xth byte from
computer 1,computer 3,computer 4,computer 5,...computer x..
similarly other can do.
On Wed, Aug 22, 2012 at 2:04 PM, Karthikeyan V.B <kartmu...@gmail.com>wrote:
> A network of N computers is such that each computer is connected to
> every other.Transferring one byte of information between two computers
> takes one unit of time. In the beginning, a file resides on only one
> computer on the network. The size of the file is M bytes. Come up with a
> strategy to duplicate this file across all N machines {that is each machine
> should have a local copy of the file} in minimum amount of time.
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
