I have no clue if this is correct for computer engineering. Please help with all answers even if they're correct I need to be absolutely sure, especially 6! Thank you!!

Question 1 4 pts Consider the following 10-bit fixed-point binary value: 0111011.011 What is its value in base 10 with three digits of precision after the decimal point? [value] 59.375 Question 2 4 pts You are given the following partial ASCII table of characters: 20 sp 21 ! 22" 23 # 24 $ 25 % 26 & 27 28 ( 29 ) 2A * 2B + 20, 2D - 2E. 2F / 30 0 31 1 32 2 33 3 34 4 35 5 36 6 37 7 38 8 39 9 : 3B; 3C 3F ? 40 @ 41 A 42 B 43 C 44 D 45 E 46 F 47 G 48 H 49 I 4A J 4B K 4C L 4D M 4E N 4F O 50 P 51 O 52 R 53 S 54 T 55 U 56 V 57 W 58 X 59 Y 5A Z 5B 5C 5D ] 5E A 5F 60 61 a 62 b 63 c 64 d 65 e 66 f 67 g 68 h 69 i 6A j 6B k 6C 1 6D m 6E n 6F O 70 p 71 g 72 r 73 s 74 t 75 u 76 v 77 w 78 x 79 y ZA Z 7B { 70 7D } ZEN 7F del Which one of the following is not the correct 8 bit ASCII representation of the 3 character emoji? O >:P is 00111110 00111010 01010000 O :^) is 00111010 01011110 00101001 O :-( is 00111010 00101101 00101000 O :-) is 00111010 00101101 01011101 Question 3 4 pts Consider the following IEEE 754 32-bit floating point value: 11011110 01011000 00000000 00000000 Enter its sign as either + or - Enter its exponent part's value in base 10. 188 Enter its fraction part's value in base 10 as 0.XXXX where X is a digit. 0.5767 Question 4 4 pts You are given the following three simple Turing Machines that implement the logic operations NOT, AND, and OR, and their connections are labeled with the letters a through h: a a_TNOT b T AND e TOR h Connect together these simple machines with the inputs 1, 2, and 3 to form the logical function exactly as shown below (no simplifying the function): ((NOT 1) AND 2) OR 3 input 2 connects to d input 1 connects to c b connects to c Oh connects to a Ob connects to f input 3 connects to f input 3 connects to c O e connects to g input 1 connects to a Question 5 4 pts Convert 2.37510 to its equivalent in IEEE 754 32-bit floating point representation. Be careful when entering your 32-bit answer. You may answer in any one of the following ways: ungrouped: 01010101010101010101010101010101 groups of 8 bits separated by single spaces: 01010101 01010101 01010101 01010101 groups of 4 bits separated by single spaces: 0101 0101 0101 0101 0101 0101 0101 0101 0 10000000 0011000000000000 Question 6 4 pts Name a task that you enjoy doing. Describe several high-level steps to complete that task. Next, take each of those steps and break them down into more detailed steps. For example (Using this example will result in 0 points!): Bake a Cake 1. Get ingredients 1. determine ingredients you already have 2. go to store to buy needed ingredients 2. Combine ingredients 1. get a mixing bowl and blender 2. pour in ingredients 3. blend 3. Bake mixture 1. set oven temperature 2. pour xture into cake pan 3. put pan in the oven 4. remove pan from oven when it looks and smells delicious Edit View Insert Format Tools Table 12pt Paragraph v B IU Av 2 Tv V Ev V Question 7 4 pts Consider a simple Turing Machine, Tada, that only does addition on two inputs to produce the sum as its output: T add + b We can sum 8 inputs (a through h) by connecting together seven of these simple machines: a Tadd1 ba T add3 c T add2 T add5 f T add 4 T T add6 addum Assume the following: each Turing Machine is very slow and takes 1 second to output the result of its addition each Turing Machine can run simultaneously each Turing Machine can only do its addition when both of its inputs are ready the inputs a through h are all immediately available What is the total time in seconds for sum to be produced? 5 What is the sum output by Tadas? Enter your sum using the input letters in alphabetical and using + without any spaces (e.g., a+b+c). [(a+b) + (c+d)] + (e + 8 What is the total time for the slowest possible configuration using 7 of these simple Turing Machines? Question 8 4 pts Assume each choice below shows the addition of two 6-bit fixed-point binary integers. Mark every choice that results in overflow. FYI: Be certain; Canvas deducts points for incorrect choices. 1010.10 +1110.00 0011.01 +0100.10 0111.10 +0000.11 1110.10 +0001.10 1010.10 +1101.01