SEHH2264-Computer Organisat ion Lab 6 Page 1 Subject : SEHH2264 : Computer Organisation Lab/Tutorial : Session 6 Revision 1) What are the maximum and minimum values that can be represented using 6 bits under the following representations: a) 2’s complement. b) Signed magnitude representations. 2) Given the following binary numbers, 5-bit values in signed-magnitude representation. Perform the operations and indicate if there is any arithmetic overflow. a) 100111 + 111010 b) 111000 - 100100 3) Consider a 32-bit floating point format where 1 bit as sign bit, 8 bits as exponent in biased 127 representation, and 23 bits as normalized significand as shown. a) Calculate the decimal value for the floating point number 1100 0101 1010 1010 0000 0000 0000 0000. b) Express the decimal value 35.890625 as a floating point number that matches the above given format. 4) Simplify the following expressions using K-map. a) F = ̅̅̅ + ̅̅̅ + ̅̅ + ̅̅̅ + ̅̅ + ̅̅ + ̅̅ + ̅ b) F = ̅̅̅ + ̅̅̅ + ̅̅ + ̅̅ c) F = ̅̅̅ + ̅̅̅ + ̅̅ + ̅̅ + ̅ + ̅ + ̅ + + ̅̅ 5) For the expression: A = xyz’ + x’y’z + xyz + x’yz. a) Simplify A using appropriate Boolean identities. b) Simplify A using Karnaugh Map (K-Map). c) Draw the combinational circuit diagram for the simplified expression. d) Convert your result in (c) using only NAND gates. Do NOT simplify. e) Simplify your resulting diagram in (d).