Category: Uncategorized

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

Interpret the following 7 bit binary sequence  1000001  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 3 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

Let X = 001110, Y = 011100 and Z = 101001. What is the result of: (X AND Y) OR Z

Interpret the following 7 bit binary sequence  1000111  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 3 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

Interpret the following 7 bit binary sequence  1000010  as specified below: base 10 value for unsigned integer [unsigned] base 10 value for 1’s complement integer [1scomp] 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

You are given the following three simple Turing Machines that implement the arithmetic operations – NEGation, x MULtiplication, and + ADDition, and their connections are labeled with the letters a through h : Connect together these simple machines with the input variables A, B , and C to form the calculation exactly as shown below (no simplifying the calculation): (-A) + (B x C)

Interpret the following 7 bit binary sequence  1000011  as specified below: base 10 value for unsigned integer [unsigned] base 10 value for 1’s complement integer [1scomp] 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

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

Assume that there are 800 players registered for a multiplayer online game. If every player is to be assigned a unique bit pattern, what is the minimum number of bits required to do this? [n] How many more players can be registered without requiring additional bits for each player’s unique bit pattern? [s]

Assume that there are 150 players registered for a multiplayer online game. If every player is to be assigned a unique bit pattern, what is the minimum number of bits required to do this? [n] How many more players can be registered without requiring additional bits for each player’s unique bit pattern? [s]