question 1 parts 1 through 3 thank you

lfreeCooecamo Forum: nderstand Javascript . r i g csci 201 1 Class profile Homework3ndr \ .3 Hunter x Hunter 2011): x , Homel Chegg.com Secure I https://piazza-resourcess3.amazonaws.com/jgopch0cb93d8/j k3.pdf AWSAcce skyld-AKIAltDNKLJ4ALKBW6HA8Expires-1520015685&Signature-ORqiKArW4JLWSXcSRqlL93ki A. Homework3.pdf 1 12 Show your 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 1100 011 10001010 binary) stored in memory if it is (a) 16-bit signed magnitude integer (b) -bit one's complement signed integer (c) 16-bit two's complement signed integer (d) 16-bit unsigned integer (e) 8-bit unsigned integer (f) 8-bit two's complement signed integer (g) 16-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! Ifyou find a repeating pattern, write the fraction you think it is, and round to the ninth fractional digit (billionths): a) 101 10 001 1010 1100 0000 0000 000 b) 0 1000 1110 0100 1010 1010 1010 1010 101 d) 00000 0000 1011 0000 0000 0000 0000 000 e) 110000 0001 0000 0000 0000 0000 0000 000 02222018-Doubl pptx ^ | Show all LinkedListN evi...ppox 06integers:1].potx okpala.richardtog zip 1035 AM 3/2/2013 O Type here to search ^ L