Exams › GATE › Technical

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

1. 2(n-1)
2. n/2
3. 2ⁿ
4. 2^(n-1)

Correct answer: 2^(n-1)

Solution

The maximum number of prime implicants for an n-variable Boolean function is determined by the number of combinations of the variables that can form distinct groups, which is represented by 2^(n-1). This accounts for the various ways the variables can be combined while still maintaining the properties of prime implicants.

Related GATE Technical questions

• If fixed positive charges are present in the gate oxide of an n-channel enhancement type MOSFET, it will lead to
• In the ac equivalent circuit shown in the figure, if i_in is the input current and R_F is very large, the type of feedback is
• In the following circuit employing pass transistor logic, all NMOS transistors are identical with a threshold voltage of 1 V. Ignoring the body-effect, the output voltages at P, Q and R are
• In a code-division multiple access (CDMA) system with N = 8 chips, the maximum number of users who can be assigned mutually orthogonal signature sequences is _______.
• The capacity of a Binary Symmetric Channel (BSC) with cross-over probability 0.5 is _______.
• The force on a point charge +q kept at a distance d from the surface of an infinite grounded metal plate in a medium of permittivity ε is

⚔️ Practice GATE Technical free + battle 1v1 →