GATE 2021 · Set-2
Consider a Boolean function f(w,x,y,z) such that
f(w,0,0,z) = 1
f(1,x,1,z) = x + z
f(w,1,y,z) = wz + y
The number of literals in the minimal sum-of-products expression of f is _______________.
Related Digital Logic PYQs
Consider the following Boolean expression. F = (X+Y+Z)(X'+Y)(Y'+Z) Which of the following Boolean expressions is/are equivalent to…
Suppose we want to design a synchronous circuit that processes a string of 0's and 1's. Given a string, it produces another string…
Which one of the following circuits implements the Boolean function \[ f(x,y,z)=\sum m(0,1,3,4,5,6), \] where \(m_i\) is the \…
Consider a 3-bit counter designed using T flip-flops, as shown below. Assuming the initial state \(PQR\) is \(000\), what are the …
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\).…
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.