Blog

You are given the following three simple Turing Machines that implement the arithmetic operations: – NEGation x MULtiplication + ADDition and their connections are labeled with the letters a through h : Use the options provided below to connect together these simple machines with the input variables X, Y, and Z to form the calculation exactly as shown below (no simplifying the calculation): -(X * Y) + Z

Interpret the following 7 bit binary sequence  1101110  as specified below: base 10 value for unsigned integer [unsigned] base 10 value for sign magnitude integer [signmag] base 10 value for  fixed-point real number with 2 digits to the right of the binary point. [fixpnt] character value for ASCII [ascii] Partial ASCII Table: 20 sp 30 0 40 @ 50 P 60 ` 70 p 21 ! 31 1 41 A 51 Q 61 a 71 q 22 ” 32 2 42 B 52 R 62 b 72 r 23 # 33 3 43 C 53 S 63 c 73 s 24 $ 34 4 44 D 54 T 64 d 74 t 25 % 35 5 45 E 55 U 65 e 75 u 26 & 36 6 46 F 56 V 66 f 76 v 27 ‘ 37 7 47 G 57 W 67 g 77 w 28 ( 38 8 48 H 58 X 68 h 78 x 29 ) 39 9 49 I 59 Y 69 i 79 y 2A * 3A : 4A J 5A Z 6A j 7A z 2B + 3B ; 4B K 5B [ 6B k 7B { 2C , 3C < 4C L 5C \ 6C l 7C | 2D - 3D = 4D M 5D ] 6D m 7D } 2E . 3E > 4E N 5E ^ 6E n 7E ~ 2F / 3F ? 4F O 5F _ 6F o 7F del

Which of the following identify higher “more abstract” level(s) of abstraction than the Algorithms Layer?

Let X = 101010, Y = 110011 and Z = 000111.What is the result of: Y OR (X AND Z)Provide your answer as a 6 bit binary value like X, Y, and Z above.

Complete the truth table below for the two expressions on the right: A B NOT(A) AND NOT(B) NOT(A OR B) 0 0 [tt11] 1 0 1 0 [tt22] 1 0 [tt31] 0 1 1 0 [tt42] Are the two logical expressions equivalent? [equiv]

Consider the following IEEE 754 32-bit floating point value: 00010111 01101000 00000000 00000000 Enter S, its sign, as either + or -. [sign] Enter E, its exponent part’s value, in base 10 (not including the -127 bias). [exponent] Enter F, its fraction part’s value, in base 10 in the form 0.XXXX where X is a digit. [fraction]

Let X = 101010, Y = 110011 and Z = 000111.What is the result of: X OR (Y AND Z)Provide your answer as a 6 bit binary value like X, Y, and Z above.

Complete the truth table below for the two expressions on the right: A B NOT(NOT(A) AND B) A AND NOT(B) 0 0 [tt11] 0 0 1 [tt21] 0 1 0 1 [tt32] 1 1 1 [tt42] Are the two logical expressions equivalent? [equiv]

Which of the following identify higher “more abstract” level(s) of abstraction than the Program Language Layer?

Assume that there are 238 donors registered to attend the Morgridge Hall ribbon cutting ceremony. If every donor is to have a unique bit pattern printed on their name tag, what is the minimum number of bits required to do this so that all donors have the same number of bits? [n] Enter the number of additional donors that can register on the day of the event without requiring additional bits for each donor’s name tag? [s]