Quiz 3
They complement, F', of F(x,y,z) = x'(y'z) + (x'yz + xz + xyz)' (not simplified) is:
(x + y + z') (x'yz' + xz + xyz)
Convert -39 (base 10) to 8-bit binary using excess 127 notation
1,011,000
Perform the following signed binary subtraction assuming two's complement 10101100 - 00100100
10001000
Convert -52 (base 10) to binary 8-bit one's complement.
11,001,011
Find the "shit and the remainder of the following to vision modulo 2: 1010111 / 1101
1101 Remainder 110
How is -1 (base 10) represented in 8-bit two's complements notation?
11111111
The truth table shown below is supposed to reflect the function F(x,y,z) = y(x +z') but two lines are in error. Identify them
3 and 4
Compute the Hamming distance of code:
9
The Boolean OR operation is known as:
Boolean Sum
The Boolean AND operation is also known as:
Boolean product
What is the most common representation used in most modern computer to store single signed integer values and why?
Easy implementation, easy addition and subtraction and unique representation for +0 and -0
Digital computers contain circuits that implement Boolean functions and the simpler that we can make the Boolean function, the larger the circuit that will result.
False
In order to provide greater range for a floating point number, we make a significand larger.
False
The general idea of Booth's algorithm is to increase the speed of addition when there are consecutive zeros or ones in the multiplier.
False
A Boolean function can be created with at least one answer to a variable, at least one Boolean operator, and has at least one input from the set {0,1}
True
DeMorgan's provides an easy way of finding the complement of a Boolean function Eric assist in replacing each variable and his complement and change all ANDs to ORs and all ORs to ANDs.
True
Only a limited ranged of real numbers can be expressed using the IEEE 754 standard.
True
Overflow is indicated when the carry in to the high-order bit is not equal to the carry out.
True
Which of the following questions correctly reflects the true table shown below?
x'yz' + x'yz + xy'z' + xyz' + xyz
The Boolean function F(x,y,z) = y(x'z + xz) + x'yz' + xy'z simplifies to:
xz + x'y