Merge sort has a o(n log2(n)) complexity. if a computer can sort 1,024 elements in an amount of time x, approximately how long w
1 answer:
You might be interested in
Answer:
The time elapsed is 0.017224 s
Solution:
As per the question:
Analog signal to digital bit stream conversion by Host A =64 kbps
Byte packets obtained by Host A = 56 bytes
Rate of transmission = 2 Mbps
Propagation delay = 10 ms = 0.01 s
Now,
Considering the packets' first bit, as its transmission is only after the generation of all the bits in the packet.
Time taken to generate and convert all the bits into digital signal is given by;
t =
t = (Since, 1 byte = 8 bits)
t = 7 ms = 0.007 s
Time Required for transmission of the packet, t':
Now, the time elapse between the bit creation and its decoding is given by:
t + t' + propagation delay= 0.007 + + 0.01= 0.017224 s