Simplification of Boolean Expression using Boolean Algebra Rules | Important Question 3
ฝัง
- เผยแพร่เมื่อ 6 ก.ย. 2024
- In this video, we are going to discuss some more questions on simplification of boolean expressions using rules of boolean algebra.
Check out the videos in the playlists below (updated regularly):
Sensors, Transducers and Instrumentation : • Sensors, Transducers a...
Computer Networking and Data Communication : • Computer Networking an...
Communication Systems : • Communication Systems ...
Circuit Theory : • Circuit Theory
Analog Electronics : • Analog Electronics
Digital Electronics : • Digital Electronics
Engineering Mathematics : • Engineering Mathematics
Control Systems : • Control Systems
Am new her but I've learned something that I've been trying so hard to understand.. Now I got it..
I appreciate alot
One night before the exam, you cleared my mind about simplification of boolean expressions, thank you!!!
Helped me learn this concept in an easier way, thank you
Logic and rules are defined very finely
Dil se respect h apke liye ❤
thankyou sir we need people like you
Sir bahut badiya samjhate ho❤❤❤
This was just wonderful..... I appreciate the knowledge
Thank you for your feedback.
Thank you so much, this shit made no sense to me until god sent your beautiful self my way
Thank you very much I need more videos on boolean expression reduce method
Namaskar Ji, Very good initiative
this is very good i understand it easily
Thank you! Great explanation! :)
Good sir🤗🤗
Great explanation.It helped me a lot.Thank you sir
why not doing D('not'ABC+1) instead of 'not'abc(1+D)?
thanks for answering in advance!
Because d is not common in both terms bro
thank you bbg that really helped
cant you just do absorption law straight away so a[b+c(ab+ac)] so b+ab = b so it final becomes a[b+c]
Can you provide the link of your tutorial/explanation about the De Morgan's Theorem? Thank you.
Very nice class
very GOOD!
Great explanation... Thanks man
Thank u very much sir🙏
Good points
Very good
Tq u soooo much sir great work
Hi sir can you please simplify the following term. ab'd'+acd'+a'bc'd'+abc'd
A(D'+BC'D)
Thanks really
Good video ❤
Thanks sir
Thanks ☺️
Then what we can write if there is (ABC)' ?
Thanks yoooouu also🙂🙂🙂
Thanks bro for your nice explanation 😇😇
Tnx
Why did you add (1+D)?
Yhe one kaise aa raha h
Great Content Sir :)
Really helped me .
Thanks for the feedback.
Tq sir. it's really helpful to me
Any easy method sir
Points
sorry how did u get the 1 in 2:00
Yeah idk either
But in that step yoy can apply the absorption rule. X+Xy=X. So B+ABC is just B. B representing X, y representing AC.
@@gabrielbarrera3447 he took B common from the first two terms (B +ABC) so obviously the expression is B(1+ABC) since there can't be 0 there.
U did it wrong in 1st question 1+x = x
No it's 1
@@charlesakintunde4767 how??
its x
Its called the Dominance Law
A+1=1
Any Boolean Expression directly added into 1 will result in 1.
A.0=0 is also another expression.
Women ☕
Bruh, its called Identity Rule in OR-Form , and it has result = 1; A + 1= 1
In AND-Form it is; A × 1 = A
B+AB'+AB'C+A'B+AB'CD+A'BC'DE'
HOW TO SIMPLIFY
Rearrange
B+A'B+AB'+AB'CD+A'BC'DE'
B(1+A')+AB'(1+CD)+A'BC'DE'
B + AB' + A'BC'DE'
Taking only B + AB' --> B + A
B + A + A'BC'DE'
A + B(1+A'C'DE')
(A + B)
:)