Boolean Algebra and Logic Simplification Questions and Answers

Practice Mode
Showing 10 of 41 questions
Q11
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
Answer: Option A
Q12
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
Answer: Option A
Q13
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
Answer: Option B
Q14
The truth table for the SOP expression has how many input combinations?
  • A 1
  • B 2
  • C 4
  • D 8
Answer: Option D
Q15
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
Answer: Option D
Q16
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
Answer: Option C
Q17
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
Answer: Option D
Q18
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
Answer: Option B
Q19
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.
Answer: Option C
Q20
An OR gate with schematic "bubbles" on its inputs performs the same functions as a(n)________ gate.
  • A NOR
  • B OR
  • C NOT
  • D NAND
Answer: Option D

📚 More from Digital Electronics

← All Topics 🎯 Practice ⏱️ Take Test 🔍 Search
Digital Electronics
Back to Digital Electronics
Other Subjects
Questions and Answers for Competitive Exams Various Entrance Test