GATE 2016 · CS1 - Forenoon
Consider a carry lookahead adder for adding two n-bit integers, built using gates of fan-in at most two. The time to perform addition using this adder is
Related Digital Logic PYQs
Consider the Boolean operator # with properties: x # 0 = x, x # 1 = x', x # x = 0, and x # x' = 1. Then x # y is equivalent to
We want to design a synchronous counter that counts the sequence 0-1-0-2-0-3 and then repeats. The minimum number of J-K flip-flop…
Consider two cascaded 2-to-1 MUXes. MUX 1 inputs: 0 (at in0), R (at in1) with select P. MUX 2 inputs: R' (at in0), Output_MUX1 (at…
Consider an 8-bit ripple-carry adder for computing A + B in 2's complement form. If decimal value of A is 1, the decimal value of …
Let x1 ⊕ x2 ⊕ x3 ⊕ x4 = 0 where x1, x2, x3, x4 are Boolean variables and ⊕ is the XOR operator. Which one of the following must al…
Consider the following Boolean expression of a function F: F(P,Q) = (P' + Q) XOR (P'Q). Which of the following expressions is/are …
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.