26. Determine which rule is being used in each step of the following Boolean simplification: ABC+ ABC + ABC BC(A + A) + ABC BC + ABC C(B+ AB) C(B+ A) AC+ BC

Question 4 Use Karnaugh map to simplify the expressions below: a) F = ABCD + ABC +ĀC + ABC b) F = ABCD + ABC + ABC + ABCD c) F = ACD + ABC + BC

1| Rev 001 Eff Date: 09-08-2023 QP-ASR-001 | Rev 001 Eff Date (b) Draw a logic circuit diagram of the following Boolean expression: i. AB+C+ACB+B ii. ABC + ABC + AC (c) Convert the following expression to sum-of-product form F(A, B, C) AB + BC + AC Question 3: [Total Marks: 10] [5 marks] [5 marks] [5 marks] (a) Draw the logic circuit diagram for the following Boolean expressions using only NAND Gates X= AB (b) Draw the logic circuit diagram for the following Boolean expressions using only NOR Gates X=AB Question 4: [Total Marks: 10] (a) What is the Control word for the following micro-operations? [6 marks] i. R1 <- R2 + R3 ii. R2 <- SHR R2 Page 2 of 3 iii. R7 <- R2-R3 (b) The following instructions are performed in a processor based on general register organization. If R1 = 1001 and R2 = 1101, what will be the value of register R2 in the following operations: i. R2 <- SHR R2 ii. R2 <- R2 + R1 [4 marks] Question 5: [Total Marks: 15] Given the expression (A+B)*(C-D)+(E/F*G) (a) Find the…

Simplify the following expressions to their shortest form: 3. AB+ BC +BC+ ABC 4. ABC+ ABC + ABC 5. A(AB) + B(AB)

q in pic

13. Convert the standard sum of product form to canonical sum of product form forthe following Boolean function:F = CD + DE

ax2 + bx + c = z (in programming format)

Q3. Write and simplify the Boolean Expression *. obtained from the following logic diagram

Define Xor operator

2. Give the NFA with e-move for the following regular expression. w = (ab + a)*