please type ur answers. Given the following Truth Table on the right: Inputs Outputs ABC X...
Write Truth Table for Y = AB + AB' + A'B **Truth table has inputs ABC** ABC AB AB' A'B Y 000 001 010 011 100 101 110 111 Y={m (___________________________)
3) Write the Boolean Expression for function Z as defined by the following Truth Table in both canonical and simplified forms. Implement function Z using a NOT-AND-OR network. (Please, use straight lines for connections. Use shaded areas to neatly draw your gates.) Z 888 ABC 000 001 010 011 100 101 110 III Z (from Table) - Z (simplified) =
use ‘ for not Question 2 Given the following Truth Table: Inputs AB Outputs X 00 0 1 11 1. Construct a K-Map on Scrap Paper 2. Perform Grouping on Scrap Paper 3. Give the SIMPLEST Boolean Expression for x in the answer box below. Note: Do not include "x="in your answer it will be marked wrong
1. write a truth table using this symbol: --> 2. write the inputs for the truth table to the left of the --> and write the outputs for the truth table to the right of the --> 3. write the compliment, or NOT using ' As an example: The truth table for AND is written this way: A B --> A AND B 0 0 --> 0 0 1 --> 0 1 0 --> 0 1 1 --> 1 or...