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
Related Digital Logic PYQs
The number of min-terms after minimizing the following Boolean expression is ________. [D' + AB' + A'C + AC'D + A'C'D]'.
The truth table represents the Boolean function
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
The base (or radix) of the number system such that the following equation holds is __________. 312 / 20 = 13.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…
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 …
Free account benefits
Turn practice into measurable progress
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.
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.