Simplification of Boolean Functions Multiple Choice Questions 1 PDF Download

Practice simplification of boolean functions multiple choice questions (MCQs), digital logic design test 1 for online exams. Practice two and three variable maps MCQs questions and answers on two and three variable maps, map method, product of sums simplification, dont care conditions, four variable map with answers. Free simplification of boolean functions quiz, online study guide has helping answer key with choices as six minterms, eight minterms, five minterms and four minterms of multiple choice questions as two variables will be represented by to test learning skills for viva exam preparation and job's interview questions. Study to learn two and three variable maps quiz questions with online learning MCQs for competitive exam preparation test.

MCQ on Simplification of Boolean Functions Quiz PDF Download Test 1

MCQ. Two variables will be represented by

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


MCQ. NAND function is represented by

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


MCQ. The output of AND gates in Sum of Product (SOP) is connected to

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


MCQ. The logical sum of minters associated with boolean function specifies the conditions under which the function is

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


MCQ. The minterms in a karnaugh map are marked with a

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