Answer Happy

2. Explain your reasoning. Just writing final answer will not get you points. a) A computer word has sixteen bits. Each bit can be (0, 1). How many possible bit strings can be formed using sixteen bits? (2 points) b) An integer word is also a sixteen bit representation with the first bit as sign-bit and the remaining 15 bits representing the magnitude. Sign-bit 0 means positive integer, and sign-bit 1 means negative integer. +0 and -0 are counted as just 0. For example, +0 is 1 000 000 000 000 000 and -0 is 0 000 000 000 000 000. How many positive and negative integer values can be represented in a word? (3 points) c) A binary string is a concatenation of binary number (0, 1). As discussed in the class, binary unit is 0 or 1, binary ten is 2¹, binary hundred is 22, binary thousand is 2³,...... The most significant digit is the left most digit like natural numbers. Thus, binary eight bit string 11001011 is equivalent to 1 x 27+ 1 x 2 + 0x2 + 0x2 + 1 x 2³ +0x2²+1x 2¹ + 1 x 2° = 128 +64 +0 +0+8+0+2+1=203. Calculate the natural number values for the following bit strings. Show your calculations: (3 points) (1) 11100011; (ii) 10101111; (iii) 00110000