Question

Tim Question 1 Atte 20 pts 2H 24 Design a 1-bit Full Adder using NOR gates only, you must include and show: Truth tables, detail logic gate circuit designs, and Boolean expressions Upload Choose a File 20 pts Question 2 Design a 4-bit Full Adder with inputs (Xo...X3, Yo...Y3) in which inputs X are connect to two 4-bit registers via four 2-to-1 Multiplexers and inputs Y are connected to two other 4-bit registers via four 2-to-1 Multiplexers. In this case assume that Carry in is always zero (and is therefore pull down) and that the register outputs 4-bits at a time. Make sure to show the proper connections between Full adder, MUXS, and registers Choose a File Upload Stop sharing Hide ckaring vour screen.

Answer 1

Feull Addler ates NOR Cout 2X Ae 9 cio Sum Trutb table INPUTS OUTPUTS A C-IN SUM e-OUT C C 1 1 1 Out peut at 2: CA+ AB):LAB) out pat Out put at 4 : (A B+ AB= A8+ AB A'B CA'+ B AB : at 3: CB +시'B')' K AOB oubpat at 5: +K) = c'k Outpeut at 6 :(k+ c' k') CK+c)' K'C utpeut at :CC +c'k) Ce'+c)' KC outpat at 8 :C' k+A CA+BICC+ AB AIB K CA+B)C C4 AB AI8) AC+ AB 4 ec+ ABC ABtBC +AC Ke +c Ocutpat at q: Ck'crel )' Ck)ck'c K'C A@B C A BOS - O-- ---