How many check bits are needed if the Hamming error correction code is used to detect single bit error in a 720 -bit data word?

Give the bit pattern that would result from a bitwise AND, OR and XOR operation on the following two bit patterns: 10101010 11110000 AND: OR: XOR:

In single precision (IEEE-754 standard), 8 bits are used for storing the exponent (the bias is 127), and 23 bits are used for storing the mantissa.  (a) What are the smallest and the largest positive numbers that can be stored in single precision? (b) What is the smallest value of the mantissa that can be stored?

"Rabenstein code was used to send a message with 4 information bits, you receive 100110001 , if you can expect at most one bit of corruption, what were the original information bits?