question 1 part 2 and 3 thank you

(47) Naruto Notone C Sign In er Sign Up | Ch UFC & MMA Secure I https://piazza-resourcess3.amazonaws.com/jgopch0cb93d8/j .pdfAWSAccessKeyld-AKAILDNRL/4ALKBWOHA8lexpires-15200435/2&Signature-ol9aXG9 /UAKIHS0QUwMeyBX.. quations must be properly tyne-set including superscript-s expunents, Always watch the course websile for updates on the assignments. Question 1 (4 points) Show you work I. Convert 2727 into a 32-bit two's complement binary number 2. Convert -5795 into a 16-bit two's complement binary number 3. Add the above two binary numbers together as 32-bit two's complement binary numbers hy sign-extending signed integers and padding any unsigned integers with leading Os, writing your answer as an 8-hextet hexadecimal value. Question 2 (24 points) Show the value represented by 1100011 100000inary) stored in memory if it is (a 16-bit signed magnitude integeir (b) l6-bit one's complement signed integer (c) 16-bit two's complement signed integer (d) 16-hit unsigned integer (e) 8-bit unsigned integer (f) 8-bit two's complement signed integer (g) l6-bit biased integer using excess-32768 (h) UTF-8 Question 3 (10 points) Find the decimal number equivalent of the following IEEE 754 single-precision numbers. You must show your work! If you find a repeating pattern, write the fraction you think it is and round to the ninth fractional digit (billionths): a) 110101 1011 1001 1010 1100 0000 0000 000 b) 01000 1110 10100 1010 1010 1010 1010 101 c) L11 11 001 1000 0101 1010 0100 001 d) 00000 0000|1011 0000 0000 0000 0000 000 e) 110000 0001 0000 0000 0000 0000 0000 000 O Type here to search 13 PM /2/2018