Logic Functions and Minimization GATE 2014 Question #9903 with Solution

GATE 2014 · session-2

Digital LogicLogic Functions and MinimizationmediumMCQ1 mark

The dual of a Boolean function F(x₁,x₂,…,xₙ,+,·,′), written as Fᴰ, is the same expression as that of F with + and · swapped. F is said to be self-dual if F=Fᴰ. The number of self-dual functions with n Boolean variables is

A2ⁿB2^(n−1)C2^(2ⁿ)D2^(2^(n−1))

Save your progress

Related Digital Logic PYQs

GATE 2014 · Set-3

The number of min-terms after minimizing the following Boolean expression is ________. [D' + AB' + A'C + AC'D + A'C'D]'.

GATE 2014 · Set-2

The truth table represents the Boolean function

GATE 2014 · SET - 2

The minimal sum-of-products (SOP) expression for the Boolean function F(A, B, C) = Σm(0, 1, 4, 5, 6) is

GATE 2014 · session-1

Consider the following Boolean expression for F: F(P,Q,R,S) = PQ + P̅QR + P̅QR̅S. The minimal sum-of-products form of F is

GATE 2014 · session-1

The base (or radix) of the number system such that the following equation holds is __________. 312 / 20 = 13.1

GATE 2014 · session-1

Consider the 4-to-1 multiplexer with two select lines S₁ and S₀ given in the image. The minimal sum-of-products form of the Boolea…

Saved progressKeep answers, mock results and completion history across devices.

Adaptive practiceGet questions matched to your recent accuracy and difficulty level.

Bookmarks and notesBuild a personal revision list and record why a question was difficult.

Performance insightsSee weak subjects, accuracy trends, streaks and exam readiness.

Related Digital Logic PYQs

Turn practice into measurable progress