CSO1 Midterm Review
We will pass the midterm!
Made by @qjy7du
1 1
1
48
1: Which bitwise expression is logically equivalent to (x & y) | (x & ~y)?
45.0s
x
y
x ^ y
~x & y
2: If 1100101001101101 is a 16-bit floating point number with a 5-bit exponent value, what is the exponent is base-10?
45.0s
1
-13
15
3
3: How many carry bits occur during the binary ripple addition of 0xE7 + 0x9C?
45.0s
2
6
5
3
4: How do you know a number is odd?
15.0s
The number of even bits that are 1 is even
The low order bit is 1
The low order bit is 0
The number of even bits that are 1 is odd
5: Which bitwise expression is logically equivalent to x & (y ^ z)?
45.0s
(x | y) & (x | z)
(x & y) | (x & z)
(x & y) ^ (x & z)
x & y & z
6: Which number encoded as a 8-bit floating point number assuming a 3-bit exponent value is not normalized?
45.0s
00110101
10100101
10001100
00111100
7: What is in register 1 after the following (Assume registers initialize at 0): 0x64 0x04 0x71 0x80 0x64 0x67 0x80
60.0s