# Q1: Determine the values of A, B, C, and D that make the product term equal to 1.

A A = 0, B = 1, C = 0, D = 1
B A = 0, B = 0, C = 0, D = 1
C A = 1, B = 1, C = 1, D = 1
D A = 0, B = 0, C = 1, D = 0

A
B
C
D

# Q3: Occasionally, a particular logic expression will be of no consequence in the operation of a circuit, such as a BCD-to-decimal converter. These result in ________terms in the K-map and can be treated as either ________ or ________, in order to ________ the resulting term.

A don't care, 1s, 0s, simplify
B spurious, ANDs, ORs, eliminate
C duplicate, 1s, 0s, verify
D spurious, 1s, 0s, simplify

A 1
B 2
C 3
D 5

# Q5: The NAND or NOR gates are referred to as "universal" gates because either:

A can be found in almost all digital circuits
B can be used to build all the other types of gates
C are used in all countries of the world
D were the first gates to be integrated

# Q6: Determine the values of A, B, C, and D that make the sum term equal to zero.

A A = 1, B = 0, C = 0, D = 0
B A = 1, B = 0, C = 1, D = 0
C A = 0, B = 1, C = 0, D = 0
D A = 1, B = 0, C = 1, D = 1

A
B
C
D

A True
B False

# Q9: When grouping cells within a K-map, the cells must be combined in groups of ________.

A 2s
B 1, 2, 4, 8, etc.
C 4s
D 3s

A zero
B 1
C 4
D 5

# Q11: The expression W(X + YZ) can be converted to SOP form by applying which law?

A associative law
B commutative law
C distributive law
D none of the above

A
B
C
D

A
B
C
D

A (A)
B (B)
C (C)
D (D)

A (A + B)(C + D)
B (A)B(CD)
C AB(CD)
D AB + CD

# Q16: Use Boolean algebra to find the most simplified SOP expression for F = ABD + CD + ACD + ABC + ABCD.

A F = ABD + ABC + CD
B F = CD + AD
C F = BC + AB
D F = AC + AD

A A + B = B + A
B AB = B + A
C AB = BA
D AB = A × B

A
B
C
D

A True
B False

A NOR
B OR
C NOT
D NAND

A
B
C
D

# Q22: The systematic reduction of logic circuits is accomplished by:

A using Boolean algebra
B symbolic reduction
C TTL logic
D using a truth table

A associative
B commutative
C Boolean
D distributive

A 1
B 2
C 4
D 5

A X = A + B
B
C X = (A)(B)
D

# Q26: Which of the examples below expresses the distributive law of Boolean algebra?

A (A + B) + C = A + (B + C)
B A(B + C) = AB + AC
C A + (B + C) = AB + AC
D A(BC) = (AB) + C

A
B
C
D

A
B
C
D

A NOT
B OR
C NOR
D NAND

A
B
C
D

A 1
B 2
C 4
D 8

A 1
B 2
C 4
D 8

# Q33: Which of the following combinations cannot be combined into K-map groups?

A corners in the same row
B corners in the same column
C diagonal
D overlapping combinations

A
B
C
D

# Q35: Determine the binary values of the variables for which the following standard POS expression is equal to 0.

A (0 + 1 + 0)(1 + 0 + 1)
B (1 + 1 + 1)(0 + 0 + 0)
C (0 + 0 + 0)(1 + 0 + 1)
D (1 + 1 + 0)(1 + 0 + 0)

# Q36: What is the primary motivation for using Boolean algebra to simplify logic expressions?

A It may make it easier to understand the overall function of the circuit.
B It may reduce the number of gates.
C It may reduce the number of inputs required.
D all of the above

A (A)
B (B)
C (C)
D (D)

# Q38: Which of the following is an important feature of the sum-of-products (SOP) form of expression?

A All logic circuits are reduced to nothing more than simple AND and OR gates.
B The delay times are greatly reduced over other forms.
C No signal must pass through more than two gates, not including inverters.
D The maximum number of gates that any signal must pass through is reduced by a factor of two.

# Q39: One of De Morgan's theorems states that . Simply stated, this means that logically there is no difference between:

A a NOR and an AND gate with inverted inputs
B a NAND and an OR gate with inverted inputs
C an AND and a NOR gate with inverted inputs
D a NOR and a NAND gate with inverted inputs

A 1
B 2
C 4
D 5

A NAND
B NOR
C AND
D OR

# Q42: Converting the Boolean expression LM + M(NO + PQ) to SOP form, we get ________.

A LM + MNOPQ
B L + MNO + MPQ
C LM + M + NO + MPQ
D LM + MNO + MPQ

# Q43: The commutative law of addition and multiplication indicates that:

A we can group variables in an AND or in an OR any way we want
B an expression can be expanded by multiplying term by term just the same as in ordinary algebra
C the way we OR or AND two variables is unimportant because the result is the same
D the factoring of Boolean expressions requires the multiplication of product terms that contain like variables

# Q44: Which statement below best describes a Karnaugh map?

A A Karnaugh map can be used to replace Boolean rules.
B The Karnaugh map eliminates the need for using NAND and NOR gates.
C Variable complements can be eliminated by using Karnaugh maps.
D Karnaugh maps provide a cookbook approach to simplifying Boolean expressions.

# Q45: A Karnaugh map is a systematic way of reducing which type of expression?

A product-of-sums
B exclusive NOR
C sum-of-products
D those with overbars

# Q46: Applying DeMorgan's theorem to the expression , we get ________

A
B
C
D

## For help Students Orientation Mcqs Questions

One stop destination for examination, preparation, recruitment, and more. Specially designed online test to solve all your preparation worries. Go wherever you want to and practice whenever you want, using the online test platform.