Implementation of Boolean Function using NAND gates (Digital Electronics) | Quiz # 375
HTML-код
- Опубликовано: 9 фев 2025
- In this video, to implement the Boolean expression given in the question, the minimum required 2-input NAND gate is found.
Here is the detail of the Quiz.
Subject: Digital Electronics
Topic: Logic Circuit implementation using NAND gates
Digital Electronics (Playlist):
bit.ly/31gBwMa
NAND gate as Universal Gate:
• NAND gate as Universal...
#ALLABOUTELECTRONICSQuiz
#LogicGate
The Quiz will be helpful to all the students of science and engineering for preparing for university or competitive exams (GATE, IES, RRB JE, etc.)
Follow me on RUclips:
/ allaboutelect. .
Follow me on Facebook:
/ allaboutelec. .
Follow me on Instagram:
/ all_about.e. .
Music Credit:
www.bensound.com/
Digital Electronics (Playlist):
bit.ly/31gBwMa
NAND gate as Universal Gate:
ruclips.net/video/cNFgilYDxuA/видео.html
Very nice as usual
Much appreciated Tutor 👏
Super Anna 🤝
Wish You happy diwali
🎉👌👍
use formula (2n-2)+k where n number of variles that is a,b,c and k is complements that is we have only one compliment b bar therefor the answer is (2*3-2)+1=5 nand gates
Can you please solve for f=A'B'+B'C'+A'C'+A'D+BD
Minimum number of 2-input NAND gates required to implement F=(X'+Y')(Z+W), pls solve this using shortcut
X' + Y' = (XY)', which requires one NAND gate.
Z+W, the OR operation of two input requires 3 NAND gate. (If required, please watch the video on the main channel)
And the AND operation of (XY)' and (Z+W) requires two NAND gates.
So, in total, it requires 1 + 3 + 2 = 6 two input NAND gates.
@@allaboutelectronics-quiz sorry but the answer is 4 two input NAND GATEs, it's a very interesting circuit. Please check 1988 GATE ECE paper for this question.
Ok, I got it. I hope, you know how to solve it. If not, then here is the way you can deal with this.
X' + Y' = (XY)'. Let's say that is equal to P. ( P = (XY)'), Which can be implemented using one NAND gate. P (Z+W) = PZ + PW.
Which is of the form AB + CD.
Anything of this sort of form requires 3 two-input NAND gates.
That means, A + B, A + CD, or AB + CD all implementations requires 3 two-input NAND gates.
So, overall it requires 4 NAND gates.
I hope, it will help you to do it in a shortcut way.
@@allaboutelectronics-quiz still don't feel like a general algorithm which can be used in other questions. Anyways thanks