1. Q(A,B,C,D) = ABC'+ A'BC+C'D'+AB'+B'C
a) Implement the previous function using logic gates.
b) implement the same function using a 16 input multiplexer (74150) only. (Hint: draw the truth table for Q)
We need at least 10 more requests to produce the answer.
0 / 10 have requested this problem solution
The more requests, the faster the answer.
1. Q(A,B,C,D) = ABC'+ A'BC+C'D'+AB'+B'C a) Implement the previous function using logic gates. b) implement the...
F5.2 Construct a Karnaugh map for the logic function: D = ABC + A'BC + ABC' + BC Find the minimum SOP expression. Realize the function using only NAND gates. [15]
4. Implement the function using only NOR gates (20 pts) (A B+C).D Sketch the logic gate schematic and verify your circuit by truth table.
Implement the following Boolean function with an 8xl multiplexer F(A,B,C,D) B'C A'BD + AB'
Question 2: Combinational Logic (15 points) Implement the following Boolean function Z(A,B,C,D) = {(1,2,5,7,8,10,11,13,15) 2.1 (5 points) Write the truth table for Z. 2.2 (5 points) Implement Z using a single 16:1 multiplexer. Make sure that you mark all inputs and outputs clearly. 2.3 (5 points) Implement Z using an 8:1 multiplexer and all necessary gates. Make sure that you mark all inputs and outputs clearly.
Create a truth table to implement AND logic using only NAND gates. Draw the circuit diagram (schematic) for the implementation. Do the same for OR logic using only NOR gates.
Implement the logic function f given in the truth table below, using only NOT gates and one 4-to-1 multiplexer. wi W2 w3f 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 1 1 0 0 1 1 0 1 0 1 1 0 1 1 1 1 1
Implement A= A B= A'B C= A'BC'+B'C D=A'BC'D'+B'C'D+AD+BCD+B'CD' Can OR Gate and AND Gate have 5 input? or it should be 2,3,4,6 inputs?
3. () Use only NAND gates to implement the Boolean function F AC +BC. (ii) Use only NOR gates to implement the Boolean function F AB+BC. Write the truth tables and draw the logic circuits for the following Boolean functions: (i) F A +BC'. (ii) F AB +C'+D. 4.
Using the Boolean logic expression below, draw circuit diagram with logic gates that will implement your Boolean expression without simplifying or expanding the expression. F(A, B, C, D) = ABD + ABCD + ABCD + ABCD Complete a Truth Table F(A, B, C, D). Use your logic circuit diagram and Boolean logic expression as much as possible.
Multiplexer Example Implement the following Boolean function using a 4x1 Mux; F(x,y,z) = Σ (1,2,6,7) Decoder Example Implement the following functions for a full adder using decoder; S(x,y,z) = Σ (1,2,4,7) C(x,y,z) = Σ (3,5,6,7) Implement the following Boolean function; F(x,y,z) = Σ (0,2,3,7): Using; 1. Two 2x4 decoders and logic gates 2. One 4x1 multiplexer Decoder . Draw the truth table for the function to be implemented. . Pick the terms for output. . Derive appropriate logic to combine terms. . Use two 2x4 decoders to make one3x8 decoder. . Pay attention to fact...