Login to track your progress, bookmark questions, and view history.
Practice over 1000+ GATE-level questions from this topic!
Designed to match the latest GATE pattern with topic-wise precision, difficulty tagging, and detailed solutions.
Q#1
Combinational Circuits
GATE EC 2000
MSQ
+2 marks
-0 marks
A one-bit full adder is to be implemented using 8-to-1 multiplexers (MUX).
(a) Write the truth table for sum (S) and carry to the next stage 
in terms of the two bits (A, B) and carry from the previous stage 
, The truth table should be in the ascending order of 
, i.e. 
.
(b) Implement S and 
using 8-to-1 multiplexers.
Explanation Locked!
Unlock this branch to view the explanation, track, bookmark and more.
Sign in to Unlock
Login to keep track of your progress with the tool with daily goals, questions preparation and more.
Browse Practice Questions by Chapters / Topics in Browse Practice Questions by Chapters / Topics in GATE Electronics and Communications
Total Questions
Attempted
% Attempted
Correct
% Correct
Login to keep track of your progress with the tool with daily goals, questions preparation and more.
Login to track your progress, bookmark questions, and view history.