Apply the CRC method on given data   dividend= 100100 and number of zero’s appended should be 1 less than divisor and divisor in this case is 1101. When there is no error When even numbers of bits are corrupted, highlights the corrupted bits. When odd numbers of bits are corrupted, highlights the corrupted bits

If the sequence number space is large enough to include k bits of information, you should carefully consider employing both the selective-repeat technique and the Go-Back-N strategy while searching for a solution. What is the biggest size that the sender window that we are allowed to use may be in total?

A bit shift is a procedure whereby the bits in a bit string are moved to the left or to the right. For example, we can shift the bits in the string 1011 two places to the left to produce the string 1110. Note that the leftmost two bits are wrapped around to the right side of the string in this operation. Define two scripts, shiftLeft.py and shiftRight.py, that expect a bit string as an input. • The script shiftLeft shifts the bits in its input one place to the left, wrapping the leftmost bit to the rightmost position. • The script shiftRight performs the inverse operation. • Each script prints the resulting string. An example of shiftLeft.py input and output is shown below: Enter a string of bits: Hello world! ello world!H An example of shiftRight,py input and output is shown below: Enter a string of bits: Hello world! !Hello world

If the sequence number space contains k bits, think about using both the Go-Back-N and selective-repeat techniques. What is the largest sender window that is permitted?

You can use both the selective-repeat and Go-Back-N approaches to solve the problem if the sequence number space is k bits in size. How large of a window can we construct for the sender?

How many collisions would you expect to find in the following cases? a. Your hash function generates a 12-bit output and you hash 1024 randomly selected messages. b. Your hash function generates an n-bit output and you hash m randomly selected messages.

If the sequence number space includes k bits, you should think about employing the Go-Back-N strategy as well as the selective-repeat strategy. What is the largest size sender window that is permitted to be?

If the sequence number space is k bits large, you should seriously consider using both the selective-repeat technique and the Go-Back-N strategy in your search for a solution. What is the maximum allowable size for the sender window that we are allowed to make use of?

If the length of the sequence number space is k bits, you may want to use the Go-Back-N and selective-repeat approaches. How large of a sender window are we allowed to use?

If the sequence number space is large enough to include k bits of information, you should carefully consider employing the selective-repeat method in addition to the Go-Back-N technique while searching for a solution. What is the maximum size that the full sender window that we are allowed to use may be?