WorksheetsMidterm Exam for AST 122
Total questions: 50
Worksheet time: 26mins
Convert hexadecimal value 16 to decimal.
2210
1610
1010
2010
Convert the following decimal number to 8-bit binary.
187
101110112
110111012
101111012
101111002
Convert binary 111111110010 to hexadecimal.
EE216
FF216
2FE16
FD216
Convert the following binary number to decimal.
010112
11
35
15
10
Convert 8B3F16 to binary.
101100111001101
1000101100110111
1011001111100011
1000101100111111
Convert decimal 64 to binary.
01010010
01000000
00110110
01001000
Convert hexadecimal value C1 to binary.
111000100
111000001
1000111
11000001
Convert the following octal number to decimal.
178
82
57
15
51
Convert the following binary number to octal.
0101111002
2748
1748
2728
1728
How many binary digits are required to count to 10010?
2
3
7
100
The binary number for octal 458 is ________.
100010
100101
110101
100100
Convert the following binary number to decimal.
100110102
155
157
154
153
The decimal number 188 is equal to the binary number ________.
1100011
10111100
1111000
0111000
Convert the following binary number to octal.
0011010112
3518
3528
1538
2538
The decimal number for octal 748 is ________.
74
22
62
60
Which of the following expressions is in the sum-of-products (SOP) form?
AB + CD
AB(CD)
(A)B(CD)
(A + B)(C + D)
The commutative law of Boolean addition states that A + B = A × B.
True
False
The systematic reduction of logic circuits is accomplished by:
TTL logic
using Boolean algebra
symbolic reduction
using a truth table
What is the primary motivation for using Boolean algebra to simplify logic expressions?
It may make it easier to understand the overall function of the circuit.
It may reduce the number of gates.
It may reduce the number of inputs required.
all of the above
Which Boolean algebra property allows us to group operands in an expression in any order without affecting the results of the operation [for example, A + B = B + A]?
associative
commutative
Boolean
distributive
The NAND or NOR gates are referred to as "universal" gates because either:
can be found in almost all digital circuits
were the first gates to be integrated
can be used to build all the other types of gates
are used in all countries of the world
Which of the examples below expresses the distributive law of Boolean algebra?
A(BC) = (AB) + C
A + (B + C) = AB + AC
A(B + C) = AB + AC
(A + B) + C = A + (B + C)
Which of the following is an important feature of the sum-of-products (SOP) form of expression?
The maximum number of gates that any signal must pass through is reduced by a factor of two.
No signal must pass through more than two gates, not including inverters.
The delay times are greatly reduced over other forms.
All logic circuits are reduced to nothing more than simple AND and OR gates.
Which of the examples below expresses the commutative law of multiplication?
AB = BA
AB = B + A
A + B = B + A
AB = A × B
The expression W(X + YZ) can be converted to SOP form by applying which law?
distributive law
associative law
commutative law
none of the above
The output of an AND gate with three inputs, A, B, and C, is HIGH when ________.
A = 1, B = 1, C = 0
A = 0, B = 0, C = 0
A = 1, B = 1, C = 1
A = 1, B = 0, C = 1
If a 3-input NOR gate has eight input possibilities, how many of those possibilities will result in a HIGH output?
1
2
7
8
If a signal passing through a gate is inhibited by sending a LOW into one of the inputs, and the output is HIGH, the gate is a(n):
OR
NOR
NAND
AND
The output of an OR gate with three inputs, A, B, and C, is LOW when ________.
A = 0, B = 0, C = 0
A = 0, B = 0, C = 1
A = 0, B = 1, C = 1
all of the above
Which of the following logical operations is represented by the + sign in Boolean algebra?
AND
OR
inversion
complementation
Output will be a LOW for any case when one or more inputs are zero for a(n):
OR gate
NOT gate
AND gate
NOR gate
The output of a NOR gate is HIGH if ________.
all inputs are HIGH
any input is HIGH
any input is LOW
all inputs are LOW
The format used to present the logic output for the various combinations of logic inputs to a gate is called a(n):
input logic function
truth table
Boolean variable
Boolean constant
The Boolean expression for a 3-input AND gate is ________.
X = AB
X = A + B + C
X = AB + C
X = ABC
The output of a NOT gate is HIGH when ________.
the input is HIGH
power is removed from the gate's IC
the input is LOW
power is applied to the gate's IC
How many inputs of a four-input AND gate must be HIGH in order for the output of the logic gate to go HIGH?
any one of the inputs
any two of the inputs
any three of the inputs
all four inputs
If the output of a three-input AND gate must be a logic LOW, what must the condition of the inputs be?
At least one input must be HIGH.
At least one input must be LOW.
All inputs must be HIGH.
All inputs must be LOW.
Logically, the output of a NOR gate would have the same Boolean expression as a(n):
NOR gate immediately followed by an inverter
AND gate immediately followed by an inverter
OR gate immediately followed by an inverter
NAND gate immediately followed by an inverter
Which of the following gates has the exact inverse output of the OR gate for all possible input combinations?
AND
NAND
NOT
NOR
The output of an exclusive-OR gate is HIGH if ________.
all inputs are LOW
all inputs are HIGH
the inputs are unequal
none of the above
The output of a NAND gate is LOW if ________.
all inputs are LOW
all inputs are HIGH
any input is LOW
any input is HIGH
The logic gate that will have a LOW output when any one of its inputs is HIGH is the:
NAND gate
AND gate
NOR gate
OR gate
From the truth table for a three-input NOR gate, what is the only condition of inputs A, B, and C that will make the output X high?
A = 1, B = 1, C = 1
A = 1, B = 0, C = 0
A = 0, B = 0, C = 1
A = 0, B = 0, C = 0
The Boolean expression for a 3-input OR gate is ________.
X = A + B
X = A + B + C
X = ABC
X = A + BC
How many entries would a truth table for a four-input NAND gate have?
2
8
16
32
Which of the following is not a basic Boolean operation?
OR
NOT
AND
FOR
The logic gate that will have HIGH or "1" at its output when any one (or more) of its inputs is HIGH is a(n):
OR gate
AND gate
NOR gate
NOT operation
When reading a Boolean expression, what does the word "NOT" indicate?
the same as
inversion
high
low
When using the repeated division by 2 method of converting from decimal to binary, one must write the first remainder as the:
MSB
MSB, provided the following sequence of remainders are written in descending order until the final remainder is achieved.
LSB
LSB, provided the final remainder is used to replace the original LSB, which is then moved to the MSB position.
Convert the following hexadecimal number to decimal.
B516
212
197
165
181
