Simulate the following truth table using a 2:1 MUX and other logic gates.
|
A |
B |
C |
Y |
|
0 |
0 |
0 |
1 |
|
0 |
0 |
1 |
0 |
|
0 |
1 |
0 |
0 |
|
0 |
1 |
1 |
0 |
|
1 |
0 |
0 |
0 |
|
1 |
0 |
1 |
0 |
|
1 |
1 |
0 |
0 |
|
1 |
1 |
1 |
1 |
Mux contains many input lines ,single output lines and selection lines.In 2:1 mux there are 2 input lines , and 1 selection line.
Here s0 and s1 are the selective lines in both the diagrams.s0 indicates lsb and s1 indicates msb in selection lines in both the diagrams.
In second diagram s3 is input A
s4 is input B
s5 is input C
s6 is input D
Equation for the second diagram with logic gates is ( A(~S0)+B.S0).(~S1)+(C(~S0)+D.S0).S1 on the basis of this equation the second diagram is implemented .
If any queries please comment below.

Simulate the following truth table using a 2:1 MUX and other logic gates. A B C...
Simulate the following truth table using a 4:1 MUX plus one inverter. A B C Y 0 0 0 1 0 0 1 0 0 1 0 0 0 1 1 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 1
3) (10 points) Implement F(A, B, C) = m(0,1,4,7) using an 2-to-1 MUX (use the symbol) and any other basic logic gates necessary (AND, OR, or NOT gates). Show the truth table and minimize any combinational logic (other than the MUX) in sum-of-products form. Use the left most input(s) for the MUX select input(s) in your schematic.
Give the truth table and construct a logic circuit (using AND, OR and NOT gates as needed) for the Boolean expression ((NOT A) OR B), using the "sum of products" method.
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.
[4] (a) For the given expression draw the TRUTH TABLE Y = A B C+A.BC (b) From the truth table derive the POS EXPRESSION and implement it by basic gates (c) Redraw the logic diagram by using only universal gates. [1+1+2=4]
Q3. i) [2] Implement the following Boolean expression using basic gates. [(A + B) (C+DJE + FG 121 ii) Using K-Map deduce the value of each function W,X,Y,Z Table.3A X Y Z А 0 0 B 0 0 с 0 W 0 0 1 0 0 1 0 0 1 0 0 0 0 0 1 - 1 0 0 1 0 1 1 1 0 0 0 0 1 1 0 1 0 1 1 0 0 1 1...
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
Identify the logic gates in the combinational logic diagram below and apply the truth table to identify its output A B B2 Vcc 39k2 2.2k 2 Oscillation 10nF HE BC338 10nF 10kΩ 470Ω Detector Coil 10nF
Q2) The following is a Boolean expression of a Combinational Logic Circuit. Construct the truth table and a Combinational Logic circuit using AND, OR and NOT logic gates for the Boolean expression. Redraw the logic circuit using only NAND gates. 19 Marks) X = A B C +ABC + ABC
(1)Try to use NAND gates to achieve the truth table function of an XOR gate (2) Try to design a clicker for three people, it just needs two people to agree to pass. A,B,C indicate the people, 0 means don't agree, 1 means agree. If it passes the result is 1. Please write the truth table, the SOP (sum of products) equation and draw the logic circuit for it. (3)Use a Karnaugh-map to simplify the following Boolean function: F= AB'C'+A'B'C'+AB'C+A'B'C+AB...