Question: Question 1: Simplify the following Boolean expressions using De Morgan law and Boolean Algebra rules. Show process steps and your work clearly. Boolean expression below

Question 1: Simplify the following Boolean expressions using De Morgan law and Boolean Algebra rules. Show process steps and your work clearly. Boolean expression below can be simplified as two variables and AND gate. [15 Marks] Q = A.B.(B + C) + B.C +((B+C)+A) Question 2 [15 Marks] Using the Karnaugh map, find the most simplified Boolean Expression of output Z. Show process steps and your work clearly. A 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 B 0 0 0 0 1 1 1 1 0 0 0 0 1 1 1 1 0 0 1 1 0 0 1 1 0 0 1 1 0 D 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 z 1 0 1 0 0 0 0 1 1 0 1 0 1 1 1 0 0 1 1
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
