How many 12-bit strings (that is, bit strings of length 14) start with the sub-string 011?

How many strings of length 4 over the alphabet (a, b,c} either start with the character a or end with the character a? 45 O O O 54 81 162 27

How many hexadecimal strings of length 6 have at least one character repeat itself 2 times in a row? Examples: 22AFF3, 544460, 123455

Given the codeword set 111111 000111 110001 101100 011010 Add another codeword to this set that has distance at least 3 to all other codewords.

How many length eight binary strings (strings with eight characters, each of which is “0” or “1”)start with “111”? How many length eight binary strings contain exactly one zero?

How many 14-bit strings (that is, bit strings of length 14) are there which: a. Start with the sub-string 011? 2048 b. Have weight 4 (i.e., contain exactly 4 1's) and start with the sub-string 011? 330 c. Either start with 011 or end with 01 (or both)? 6144 d. Have weight 4 and either start with 011 or end with 01 (or both)? 825

how many 10 bit strings start and end with the same number

A What bit string represents the bitwise OR of bit strings 0110 and 1110?  B What is the difference of these sets, i.e., {1,3,4} - {2,3,5}?   C What is the value of x after this statement is encountered in a computer program, if x = 1 before the statement is reached? if x + 1 < 3 then x := x + 1 D What is the union of sets {1,3,4} and {2,3,5}? E What is the cartesian product of sets {1,3,4} and {2,9}? F Let U={0,1,2,3,4,5,6,7}. What bitstring represents the subset of all odd integers in U? G What is the powerset of set {1,3,4}? H What bit string represents the bitwise AND of bit strings 0110 and 1110? I What is the intersection of sets {1,3,4} and {2,3,5}?

If an ASCII string has an 8-bit truncated sum of 0x48, what is the value of the checksum byte for the string? Explain your answer.

Calculate the total number of bits per character. Record your answers in the chart. Character Code Frequency Total Bits A 000 4 В 001 C 010 14 D 011 13 E 100 7 F 101 17 N 110 19 What are the total bits in the original code? Reduce the number of bits used without losing any information from the chart using the Huffman Coding algorithm. Draw the Huffman Coding tree in the space provided below. Hint: You can use the Shape tool to draw the graph, or you can draw the graph by hand, then photograph or scan your graph to submit it.