Discrete Structures and Optimization - Boolean Algebra

2. The number of canonical expressions that can be developed over a 3-valued boolean algebra is

  • Option : D
  • Explanation : Canonical form=SOP or POS No of min/MAX terms=23=8. Therefore, Canonical form will have 28 have ¬†terms. Zero term canonical forms=8C0=1. One term canonical forms=8C1=8. Two term canonical forms=8C2=28 Similarly total number of canonical expressions= 8C0+8C1+8C2+8C3+8C4+8C5+8C6+8C7+8C8=256
Cancel reply
Cancel reply

  • Boolean Algebra Questions can be used by any candidate who is preparing for UGC NET Computer Science
  • This Boolean Algebra   MCQ section will help you test your analytical skills in a tricky method, thereby giving you an edge over other students
  • Any student who wants to prepare for DOEACC A Level, DOEACC B Level, and DOEACC C level can also use these Objective Type Questions Answer.
  • All candidates who have to appear for the Kendriya Vidyalaya Entrance exam can also refer to this Boolean Algebra quiz questions with answers
  • You can also get access to the Boolean Algebra MCQ ebook.
  • Boolean Algebra   Questions can be used in the preparation of JRF, CSIR, and various other exams.
  • You can also download pdf for this Boolean Algebra   multiple-choice questions Answers.
  • This Boolean Algebra in ai Multiple Choice Questions Answers section can also be used for the preparation of various competitive exams like UGC NET, GATE, PSU, IES, and many more.
  • Boolean Algebra  Objective Type Questions Answer can be used to gain a credit score in various undergraduate and postgraduate courses like BSc, MSc and MCA

Boolean Algebra  Questions

Boolean Algebra MCQ

Boolean Algebra quiz questions with answers

Boolean Algebra exam questions answers

Boolean Algebra MCQ questions Answers

Boolean Algebra MCQ Pdf

Boolean Algebra MCQ for UGC NET CS

Boolean Algebra Multiple Choice Questions For Competitive Exams