GATE 1992
A Boolean product term containing every variable of the function in either complemented or uncomplemented form is called a:
Related Digital Logic PYQs
A magnitude comparator circuit for two 1-bit inputs A and B asserts A = B when:
A full subtractor computes difference D and borrow Bout for three 1-bit inputs A, B, and Bin. The expression for D is:
Consider the following Boolean expression of a function F: F(P,Q) = (P' + Q) XOR (P'Q). Which of the following expressions is/are …
Consider a 2-bit saturating up/down counter that performs saturating up-count when \(P=0\) and saturating down-count when \(P=1\).…
Consider a Boolean function F with the following minterm expression: F(P,Q,R,S) = \(\sum m(1, 2, 3, 4, 5, 7, 10, 12, 13, 14)\) Whi…
Which one of the following options is not a property of Boolean Algebra? Note: + is OR operation, . is AND operation, and ' is NOT…
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.