Question: (a) Using Boolean algebra, minimise the expression Q=AB+A(B+C)+B(B+C) ( 9.33 marks) (b) Use a K-map to write the Boolean expression for a full adder circuit

 (a) Using Boolean algebra, minimise the expression Q=AB+A(B+C)+B(B+C) ( 9.33 marks)

(a) Using Boolean algebra, minimise the expression Q=AB+A(B+C)+B(B+C) ( 9.33 marks) (b) Use a K-map to write the Boolean expression for a full adder circuit with 3 inputs A, B and Cin and two outputs S and Cout.. Design a full adder circuit using logic gates. The full adder truth table is chmum holow Figure Q2 (b) Full adder truth table (11 marks) (c) Sketch a typical 4-bit ripple carry adder constructed using full adder components. Use this to add binary numbers 1011 and 0011 . Convert these numbers to decimal values and confirm your

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!