
Dean thinks that AB + A'B' simplifies to 1 by the Inverse law.
A. Show that Dean is wrong by fleshing out a truth table to find all rows in which AB + A'B' evaluates to 0, not 1. Circle these rows.
B. By part (a), A'B' is clearly not the inverse of AB. Using DeMorgan’s law, express the inverse of AB as a Boolean expression bexp5b that is a sum of literals.
C. Extend the truth table from part (a) to add columns for bexp5b and AB + bexp5b. All entries in the column for AB + bexp5b should have the value 1, showing that bexp5b is indeed the inverse of AB.

According to the the questions "Dean thinks that AB + A'B' simplifies to 1 which implies inverse law
As the Inverse law for Boolean algebra can be stated as follows:
For any Boolean expression X and its inverse Y which satisfies the following condition:
X + Y = 1
So as per Dean here X is AB and Y is A'B'
Let try to find that Dean statement is correct or not in Part A .
Step by stepSolved in 5 steps with 2 images

- Please explain to me how to solve each one step by steparrow_forwardWhat is the Burrows-Wheeler transform of the string "abbaba$"?arrow_forwardSam thinks that AB + A'B' simplifies to 1 by the Inverse law. a. Using the DeMorgan and Involution laws, express the inverse of A'B' as a boolean expression bexp5d that is a sum of literals. Show the application(s) of each law. b. Using the DeMorgan and Involution laws, express the inverse of (A'+B+C') as a boolean expression bexp5e that is a product of literals. Show the application(s) of each law.arrow_forward
- How to solve kmap of boolean expression of truth table of table listed in the image belowarrow_forwardwhat is the funciton of the circut? Write answer in minimized sum of products (SOP) form. example: Y=A'B+Carrow_forwardA Boolean function F (A,B,C) of truth table at below(PLS step by step) 1,Provide the minterm expansion of F . 2,Provide the minterm expansion and the maxterm expansion of F’s complement, respectively. Assume that we don’t care the value of F when ABC=001. i. What is the minterm expansion of F? ii. Choose a proper value for the don’t care term and provide the shortest possible expression of POS (product of sum) for F . (Hint: Minimize the number of maxterms)arrow_forward
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education





