Question

In: Computer Science

Find the bit length of a LAN if the data rate is 1 Gbps and the...

Find the bit length of a LAN if the data rate is 1 Gbps and the medium length in meters for a communication between two stations is 200 m. Assume the propagation speed in the medium is 2 *10^8 m/s.

Solutions

Expert Solution

Given,

        Propagation speed of the medium is = 2 *108 m/s.

        Length between two stations for a communication is = 200 m.

        Data Rate of the LAN is = 1 Gbps.

Bit Lenght is defined as the total number of bits that can be in transmission at a time on the link.

From length / propagation speed we will get the time take for the bits to travel from Source to destination and

if we multiply this with Data rate then we will get the bit Length.

Hence Bit Lenght = (length / propagation speed) * Data rate

                           = (200/ (2*108) ) * 109

                                    = 2 * 1011 / 2 * 108

                                    = 1000 bits

Hence Bit Lenght =1000 bits.


Related Solutions

How many bit strings of length 8 if i. bit strings start with the bit 1;...
How many bit strings of length 8 if i. bit strings start with the bit 1; ii. bit strings end with the two bits 00; iii. bit strings either start with the bit 1 or end with the bits 00.؟
find a recurrence relation for the number of bit strings of length n that contain the...
find a recurrence relation for the number of bit strings of length n that contain the string 10. What are the initial conditions? How many bit strings of length eight contain the string 10
find a recurrence relation for the number of bit strings of length n that contain two...
find a recurrence relation for the number of bit strings of length n that contain two consecutive 1s. What are the initial conditions? How many bit strings of length eight contain two consecutive 1s
Recall that a 5-bit string is a bit strings of length 5, and a bit string...
Recall that a 5-bit string is a bit strings of length 5, and a bit string of weight 3, say, is one with exactly three 1’s. a. How many 5-bit strings are there? b. How many 5-bit strings have weight 0? c. How many 5-bit strings have weight 1? d. How many 5-bit strings have weight 2? e. How many 5-bit strings have weight 4? f. How many 5-bit strings have weight 5? g. How many 5-bit strings have weight...
1. How many 12-bit strings (that is, bit strings of length 14) start with the sub-string...
1. How many 12-bit strings (that is, bit strings of length 14) start with the sub-string 011? 2. You break your piggy bank to discover lots of pennies and nickels. You start arranging them in rows of 6 coins. How many coins would you need to make all possible rows of 6 coins (not necessarily with equal numbers of pennies and nickels)? 3. How many shortest lattice paths start at (4, 4) and end at (13, 13)? 4. What is...
Suppose that you pick a bit string from the set of all bit strings of length...
Suppose that you pick a bit string from the set of all bit strings of length ten. Find the probability that the bit string has exactly two 1s; the bit string begins and ends with 0; the bit string has the sum of its digits equal to seven; the bit string has more 0s than 1s; the bit string has exactly two 1s, given that the string begins with a 1.
Suppose that you pick a bit string from the set of all bit strings of length...
Suppose that you pick a bit string from the set of all bit strings of length ten. Find the probability that the bit string has exactly two 1s; the bit string begins and ends with 0; the bit string has the sum of its digits equal to seven; the bit string has more 0s than 1s; the bit string has exactly two 1s, given that the string begins with a 1.
Of all bit sequences of length 8, an 8-bit sequence is selected at random. Assuming that...
Of all bit sequences of length 8, an 8-bit sequence is selected at random. Assuming that the probability of a bit being 0 is equal to that being 1, determine the probability that the selected bit sequence starts with a 1 or ends with the two bits 00.
1. Provide a regular expression that describes all bit-strings that length is at least one and...
1. Provide a regular expression that describes all bit-strings that length is at least one and at most three. 2. Provide a regular expression that describes all bit strings with odd length.
Find the diameter of a pipe of length ‘X’ when the rate of flow of water...
Find the diameter of a pipe of length ‘X’ when the rate of flow of water through the pipe is ‘Q’ and the head lost due to friction is ‘4X’. Take the value of C = 1 in Chezy’s formula. Illustrate the resut of diameter of pipe and also conclude the discharge value for varying cross section of pipe, and the relationship between diameter of pipe and pressure of flow.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT