Answer:
The longest codeword that could possibly be for "n" symbol is n-1 bits.
Explanation:
From the given information:
Suppose we are to consider a set of frequencies 
, for which f is a symbol for the length n. Therefore, the longest codeword that could possibly be for "n" symbol is n-1 bits.
However, during the encoding for "n" in conjunction with n-2, then the possibilities for n are; 
We can conclude that the longest codeword that could possibly be for "n" symbol is n-1 bits.
Answer:
Short-circuit evaluation is performed with the not operator.
Answer:
11 bit slot will be needed
Explanation:
The number of prime numbers between 1 through 16
= 2, 3 , 5, 7, 11 and 13
hence we can say 6 stations are to use the shared channel
Given that all the stations are ready simultaneously
The number of bit slots that will be needed to handle the contention will be 11 bits :
slot 1 : 2, 3, 5 , 7, 11 , 13
slot 2 : 2,3, 5, 7
slot 3 : 2, 3
slot 4 : 2 . slot 5 : 3 . slot 6 : 5,7. slot 7 : 5 . slot 8 : 7. slot 9: 11,13.
slot 10 : 11. slot 11 : 13
