Calculate the following for the data given below : (i) Entropy (ii) Coding redundancy of Binary code (iii) Coding redundancy of Huffman code

As the error-detection and correction capability of a code increases, we would expect in general the overhead bits to protect a group of data bits to decrease remain the same increase

How do the unsigned binary representations differ (ignoring the underscores)?

How are the unsigned binary representations different from one another (apart from underscores)?

How do unsigned binary representations vary (excluding underscores)?

Q2 plase text writing

H - For the IEEE 754 single-precision floating point, write the hexadecimal representation for the following decimal values: (i)–1.0 (ii)– 0.0 (iii)256.015625

What are the differences between the unsigned binary representations, disregarding the underscores?

Explain the term masking. How is it useful for data representation? Explain the concept using an example For a floating-point format with a k -bit exponent and an n -bit fraction, give a formula for the smallest positive integer that cannot be represented exactly (because it would require an n + 1 –bit fraction to be exact).

Construct a truth table in standard binary form for a function of four variables,F(W,X,Y,Z) = ABC,where ABC is the signed 3-bit sum of the signed 2-bit numbers WX and YZ.