F0 = A’B + AC’
F1 = A’B’C’ + C
F2 = A’B’ + AB
F3 = AB + AC + BC
Address |
F0 |
F1 |
F2 |
F3 |
0 0 0 |
0 |
1 |
1 |
0 |
0 0 1 |
0 |
1 |
1 |
0 |
0 1 0 |
1 |
0 |
0 |
0 |
0 1 1 |
1 |
1 |
0 |
1 |
1 0 0 |
1 |
0 |
0 |
0 |
1 0 1 |
0 |
1 |
0 |
1 |
1 1 0 |
1 |
0 |
1 |
1 |
1 1 1 |
0 |
1 |
1 |
1 |
F0: A’B + AC’
0 0 0: 1.0 + 0.1 = 0
0 0 1: 1.0 + 0.0 = 0
0 1 0: 1.1 + 0.1 = 1
0 1 1: 1.1 + 0.0 = 1
1 0 0: 0.0 + 1.1 = 1
1 0 1: 0.0 + 1.0 = 0
1 1 0: 0.1 + 1.1 = 1
1 1 1: 0.1 + 1.0 = 0
F1: A’B’C’ + C
0 0 0: 1.1.1 + 0 = 1
0 0 1: 1.1.0 + 1 = 1
0 1 0: 1.0.1 + 0 = 0
0 1 1: 1.0.0 + 1 = 1
1 0 0: 0.1.1 + 0 = 0
1 0 1: 0.1.0 + 1 = 1
1 1 0: 0.0.1 + 0 = 0
1 1 1: 0.0.0 + 1 = 1
F2 : A’B’ + AB
0 0 0: 1.1 + 0.0 = 1
0 0 1: 1.1 + 0.0 = 1
0 1 0: 1.0 + 0.1 = 0
0 1 1: 1.0 + 0.1 = 0
1 0 0: 0.1 + 1.0 = 0
1 0 1: 0.1 + 1.0 = 0
1 1 0: 0.0 + 1.1 = 1
1 1 1: 0.0 + 1.1 = 1
F3: AB + AC + BC
0 0 0: 0.0 + 0.0 + 0.0 = 0
0 0 1: 0.0 + 0.1 + 0.1 = 0
0 1 0: 0.1 + 0.0 + 1.0 = 0
0 1 1: 0.1 + 0.1 + 1.1 = 1
1 0 0: 1.0 + 1.0 + 0.0 = 0
1 0 1: 1.0 + 1.1 + 0.1 = 1
1 1 0: 1.1 + 1.0 + 1.0 = 1
1 1 1: 1.1 + 1.1 +1.1 = 1
Q3) (10 points] Tabulate the truth table of an 8x4 ROM that implements the following functions:...
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 (___________________________)
Tabulate the truth table for an 8x4 ROM that implements the Boolean functions. (a) A(X, Y, Z) = Σm(1, 2, 4) (b) B(X, Y, Z) = Σm(3, 5, 7) (c) C(X, Y, Z) = Σm(1, 2, 6, 7) (d) D(X, Y, Z) = Σm(2, 3, 5, 6, 7)
Design a 8x4 ROM with the following contents. Address 000 001 010 011 100 101 110 111 ROM Data 0001 0001 0000 0000 0111 0110 1111 0101
7. Memory. A ROM chip with a size of 8 words by 4 bits is shown in the figure below. Please use this ROM chip, implement the following four logic functions by using the dot-notation. You can mark a dot to indicate that particular cell stores a value of 1. Note: in the following figure, A is the least significant bit of the address input. (10 points) F1= ABC +A C F2= ABC +BC F3= AC + B F4- ABC...
Consider the following digital circuit fi a b f2 с " i B b'c Do a fa b The following are equivalent expressions except (select the one that is not equivalent in every case): f1 [Select ] [ Select] f1=Em(0,2,3,4,5) f2 f1=abc'+abc'+abc f1=TIM(1,6,7) f1=b'c' + ab' ta'b f3 f1=b'(a+c')+a'b iD b'c c' d- b- The following are comivalent expressions ex Select] in f2=2m(0,2,3,4,7) f2=TM(1,5,7) f2=b'cl + bc + a'b f2=b(a + c) + b'c f2=(b + c)(b + c) +...
Minimum number of IC 3. Design a circuit for the following truth table: A, B, C are inputs, F is the output BCF 000 011 100 111 001 010 101 110 a. Design with minimum logic gates b. Design with a decoder that has inverted outputs (33 points)
Design a circuit with three inputs (A, B, C) and two outputs (F1, F2). The first output F1 is logic 1 if the number of l’s in the binary number is less than the number of O's, otherwise F1 is logic 0. The second output F2 is 1 if the binary input is 2, 4, 5, 6,7 otherwise the second output F2 is logic 0. a. Derive the truth-table for F1 and F2 as a function of the 3 inputs....
Design a circuit with three inputs (A, B, C) and two outputs (F1, F2). The first output F1 is 1 when the binary input is 2, 3, 4, 7, otherwise the first output F1 is logic 0. The second output F2 is 1 when the input variables have more l's than 0's. The output is 0 otherwise. Input/ Output ABC F1 F2 000 001 010 011 100 101 a. Derive the truth-table for F1 and F2 as a function of...
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) =
please type ur answers. Given the following Truth Table on the right: Inputs Outputs ABC X 000 001 010 011 100 101 110 1110 1. Write the equivalent Canonical Sum of Products, use apostrophe (') for NOT: Ха- 2. Write the Sum of Minterms (note is the Greek symbol for Sigma - "Sum") Xml 3. Write the Product of Maxterms (note is the Greek symbol for Pi, "Product") X-ME