aliensbrain
  • Home
  • Study
  • Quizzes
  • 🎤AI Practicefree
  • Notebooks
  • Community
  • Sign in
  • 2014| SET 2 - (ECE GATE Exam) - Previous Question Paper Solution
  • For an n-variable Boolean function, the maximum number of...
Multiple choice

For an n-variable Boolean function, the maximum number of prime implicants is

  1. 2(n – 1)

  2. n/2

  3. 2n

  4. 2(n–1)

Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

Keep practicing — related questions

  • What is the maximum number of different Boolean functions involving n Boolean variables?
  • What is the maximum number of different Boolean functions involving n Boolean variables?
  • Consider the Boolean function, F(w, x, y, z) = wy + xy + $\bar{w}$xyz + $\bar{w}$$\bar{x}$y + xz + $\overli...
  • The total number of Boolean functions that can be generated by n variables is equal to
  • Which are the essential prime implicates of the following Boolean function? f (a,b,c) = a'c + ac' + b'c
  • The total number of possible boolean function involving 'n' boolean variable is?
  • The total number of possible boolean function involving 'n' boolean variable is?
  • The number of distinct Boolean expression of 4 variables is
Play the full quiz 🎤 Practise this topic out loud

Practice this topic

  • Number Theory (466 questions)
Advertisement
© Aliensbrain | all rights reserved
  • About
  • Contact
  • Terms and Condition
  • Privacy Policy