How many 8-bit binary strings contain three 0's and five 1's with no consecutive 0's

The following is a string ASCII characters whose bit patterns have been converted into hexadecimal for compactness:           CD 69 E4 54 E5 72 6D Of the eight bits in each pair of digits, the left most is a parity bit and the remaining bits are the ASCII code. Convert the string to bit form and decode the word in ASCII. What is the parity for each letter of the word?

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

1. Generate the Hamming-code for the following 12-bit data string : 1 0 1 0 1 1 0 1 1 1 0 1 Show that the generated binary string does not have any errors.

Suppose that we have the following 128-bit AES key, given in hexadecimalrepresentation:54 77 6F 20 4F 6E 65 20 4E 69 6E 65 20 54 77 6F Construct the round key for the first round.

B={1,2,3,4,5,6,7,8,9,10} Using the n-bit binaries to which subset in the power set of the ordered set B does the following bit string represent: 1100000011

What is the ASCII representation in hexadecimal of an uppercase B? What is the ASCII representation in binary of an uppercase B?

Write down the bit pattern in the fraction assuming a fl oating point format that uses Binary Coded Decimal (base 10) numbers in the fraction instead of base 2. Assume there are 24 bits, and you do not need to normalize. Is this representation exact?

How many bit strings contain exactly five 0’s and ten 1’s if every 0 must be immediately followed by a 1?

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.