Simplification of Boolean Functions Multiple Choice Questions and Answers 1 PDF Download

Simplification of boolean functions multiple choice questions, learn online digital logic design test prep 1 for CS degree online courses. Study two and three variable maps multiple choice questions (MCQs), simplification of boolean functions quiz questions and answers. Practice two and three variable maps, map method, product of sums simplification, dont care conditions, four variable map career test prep for online introduction to digital design courses distance learning.

Learn simplification of boolean functions career test with multiple choice question: two variables will be represented by, for online computer science degree with options six minterms, eight minterms, five minterms, four minterms for students, scholars and online tutors' study resource for classroom interactive questions with answers. Practice skills assessment test for online learning two and three variable maps quiz questions with digital logic design MCQs for IT certifications competitive exam prep.

MCQ on Simplification of Boolean Functions Test 1Quiz PDF Download

MCQ: Two variables will be represented by

  1. eight minterms
  2. six minterms
  3. five minterms
  4. four minterms

D

MCQ: NAND function is represented by

  1. F=x
  2. F=(xy)'
  3. F=xy
  4. F=(x+y)'

B

MCQ: Output of AND gates in Sum of Product (SOP) is connected to

  1. NOT gates
  2. OR gates
  3. AND gates
  4. XOR gates

B

MCQ: Logical sum of minters associated with boolean function specifies conditions under which function is

  1. equals to 1
  2. equals to 0
  3. none
  4. both

D

MCQ: Minterms in a karnaugh map are marked with a

  1. y
  2. x
  3. 0
  4. 1

D