3:00 Minterm and maxterm are not called that way because of their size (it's a strange pneumonic that has actually been cited in some textbooks, so I don't blame you). Minterms have "minimum satisfiability" in SOP form, that is, if any single minterm is true, the whole statement is true. Maxterms have "maximum satisfiability" in POS form, that is, all maxterms must be true for the whole statement to be true.
YEAH! True. Minterm are product terms that produces a value of logic '1' for a specific combinations and Maxterm are the sum terms produces '0' for that Function, and the variables maybe in complemented or un-complemented form.
yeah i just searched it up because i thought there was some reason behind it also min(0,0) = 0 min(0,1) = 0 min(1,0) = 0 min(1,1) = 1 So minimum is pretty much like logical AND. so this could also be another reason but i think satisfiability is a better way of thinking because it is a term
Thanks, just explaining the swap of values between SOP and POS its the only thing we need to understand it, took me half of the day to find the answer to that... Im glad that I could find it with your video for real, that should be a basic explaination on any info talking about this... Thanks for the video dude.
Why thank you. I was asked for POS and accidentally provided SOP, and couldn't figure out why the answer was so different until I watched both of your videos. I just got them mixed up. Great to have the reminder that I'm supposed to use the opposite for POS. I think I avoided using that form unless I was told back when I took digital logic, so I forgot that little detail.
Am extremely happy for your work. Your simple and comprehensive explanation to various concepts is wonderful. I don't understand a lot of things from my professors but whenever I visit your channel, everything is understandable at once. Your channel has become my favorite study material. Thank you for every effort you do to upload such comprehensive lectures. I would advice to merge the videos of one topic together such that your visitors would find it convenient to follow smoothly.
In this lecture it is said that maxterm and minterm names are given because of size. But it's wrong .Actual reason is A.B.C is called minterm because it has minimum possibility of getting a high value(1) and A+B+C is called maxterm because it has maximum possibility of getting high value(1).
Hello, in your previous video I was trying to understand how you came up with the truth table. Which logic gate did you use, AND or OR? Because I am not able to get the understanding of the table. I know for AND, all inputs must be 1 for output to be 1, and for OR, at least one input must be 1 for output to be 1. But some of the outputs are 1 and others are 0 which is confusing
The only question I really have is how do you get the result for the Y on the truth table? Is it just made up? I thought the values are determined by some circuit?
How did you get the output Y in the truth table? is it randomly put the output? or to get the output Y, we need to do any operation? like using OR gate, AND gate or what?
Followed these videos when I was studying in my college a few years back & fast forward a few years now when I am teaching a couple of lads the same stuff, I was going through these videos again - and one thing struck me this time - & I hope this helps all who comes to study from Neso: (I tried to make it so that the redundancy theorem doesn't look like it is applicable for only 3 variables - and we will be able to apply it to >3 variables) Firstly, what is a consensus term? Consider 2 terms : AB , A’C The consensus or resolvent of these 2 terms is BC. How? A consensus term is the conjunction of all the unique literals of the terms, excluding the literal that appears non-negated in one term and negated in the other. Another example: (a + b + c’).(a+b+d’).(b+c+d’) a appears in 1st & 2nd term -> both non-negated b appears in 1st, 2nd, 3rd term -> all non-negated c appears in 1st & 3rd term -> negated in 1st, non-negated in 3rd d appears in 2nd & 3rd term -> negated in both The consensus term for these 3 will be => all the terms apart from c / c’ = (a+b+d’) or, Consensus of the 1st & 3rd terms in this example is the 2nd term The redundancy / consensus theorem states, a consensus term is redundant when it co-exists along with its constructing terms. So, in the expression: ab + a’c + bc , bc is redundant
This is because there he was trying to derive the minimal POS form of the function. A+BC' is the minimal SOP, but applying Distributive law on it makes it (A+B).(A+C') which is the minimal POS.
more people have heard those dogs barking or that car honking than will ever hear my voice. or the voice of most of yall in the comments. Isn't that weird? I hope neso gets quieter videos in the future. I know this was around a decade ago so he has probably improved his recording since this video.
I think maxterm and minterm are because of nature of output from boolean expression (most of the time maxterm has high output whereas minterm has low output)
In the form (A+BC'), we have 2 gates(1 OR &1 AND) and in the form {(A+B).(A+C')}, we have 3 gates(2 OR & 1 AND), then why the form {(A+B).(A+C')} is called the minimal form!? .......{in the example given in this video}
sir please answer to my question. simplify using K map with the dont care condition into POS form F(A,B,C,D)=SUMATION(1,3,7,11,15) d(A,B,C,D)=Sumation(0,2,5) sir if u dont have time you can give me the funnction as answer. I have done but i am confused
Can you please number the videos. For example: 01. Introduction to digital electronics, just like that coze it helps in searching videos when we have downloaded them. Thank you.
my doubt is on what basis have you taken the truth table in this as well as last one because when i verified , the output depends on the no. of inputs which is more . if high input is more, output is higher and the vice versa . please clear this out.
may god give u whatever u ever wish for. You are absolutely amazing. You cant imagine how much you helped me with your videos. I LOVE U
(abc)' in demorgan form
Give answer please
@@bikkinasaikumar1399 (abc)'=(a'+b'+c')
@@bikkinasaikumar1399 Easiest PNEUMONIC to remeber DM's laws is "Break the line, change the sign"
@@AnimeRenegades nice :)
You just made it easy. If teaching is an art you are an Artist. Thank you so much.
3:00 Minterm and maxterm are not called that way because of their size (it's a strange pneumonic that has actually been cited in some textbooks, so I don't blame you). Minterms have "minimum satisfiability" in SOP form, that is, if any single minterm is true, the whole statement is true. Maxterms have "maximum satisfiability" in POS form, that is, all maxterms must be true for the whole statement to be true.
YEAH! True. Minterm are product terms that produces a value of logic '1' for a specific combinations and Maxterm are the sum terms produces '0' for that Function, and the variables maybe in complemented or un-complemented form.
yeah i just searched it up because i thought there was some reason behind it also
min(0,0) = 0
min(0,1) = 0
min(1,0) = 0
min(1,1) = 1
So minimum is pretty much like logical AND.
so this could also be another reason but i think satisfiability is a better way of thinking because it is a term
*mnemonic
thanks a lot
This video saved me today in my exams on Digital Electronics , CSE327. Thank you so much Sir for your quality videos
Am doing it tomorrow 😢
@@stellahkilaa1996 heyyyy how was your exam how did the questions come for this concept?i have mine next week :(
@@mnnr9310bro it is next week, i am literally studying on the day of exam
best tutorial for DE. Helped me a lot ..All thanks to you 🙂
Thanks, just explaining the swap of values between SOP and POS its the only thing we need to understand it, took me half of the day to find the answer to that... Im glad that I could find it with your video for real, that should be a basic explaination on any info talking about this... Thanks for the video dude.
Why thank you. I was asked for POS and accidentally provided SOP, and couldn't figure out why the answer was so different until I watched both of your videos. I just got them mixed up. Great to have the reminder that I'm supposed to use the opposite for POS. I think I avoided using that form unless I was told back when I took digital logic, so I forgot that little detail.
Explaining in such a way that a Fifth grade student can easily understand. Just wonderful... I changed my plan to divorce 'Boolean Algebra'.
I'm an undergraduate student. this help me a lot to solve my exam question. thank you so much sir
Sir ..you re really god gifted...how can you..explain all so nicely....and never mistaken..really I appreciate you ..
3.35 when you were explaining (A+B+C) and (A.B.C), You interchanged minterm and maxterm.
Great video by the way, easy to understand 😊
Much better than my lecturer thanks man. Salute you.
Mera lecturer accha tha
Maine hi dhyan nahi dia😐
way better than my Digital Logic teacher at the college i'm paying 13 grand a year in tuition at lol
Most times you are paying for the certificate
@@rabbiipictures7505 factszzz
who let the dogs out? 6:40
u better focus on study hun ...lmao u people are crazy
I was looking for your comment
Am extremely happy for your work. Your simple and comprehensive explanation to various concepts is wonderful. I don't understand a lot of things from my professors but whenever I visit your channel, everything is understandable at once. Your channel has become my favorite study material. Thank you for every effort you do to upload such comprehensive lectures. I would advice to merge the videos of one topic together such that your visitors would find it convenient to follow smoothly.
❤❤💕💕❤❤❤❤
Thank you for everything! Much love from Lesotho!❤️
anyone is here who is watching this after online class
Lol me
me
@krupali surani dekh bhi rahe honge toh kya? ... Like ki bhookhi, nibbi
Me
@@mayankchandel4678 Are bhai bhai 😀😀😀🤣🤣🤣🤣🤣
I love Neso Academy ❤️
8:22 for solve POS boolean expression
SIR I HAVE COMPLETED LECTURE 13 OUT OF 202. TREMENDOUS LECTURE AND THANKYOU FOR YOUR GUIDANCE !!
You teach very amazing sir
Thank you so much👍👍👍👍🥇🥇🥇
In this lecture it is said that maxterm and minterm names are given because of size. But it's wrong .Actual reason is A.B.C is called minterm because it has minimum possibility of getting a high value(1) and A+B+C is called maxterm because it has maximum possibility of getting high value(1).
I think there's a better reason...
see this and lemme know if I'm correct.
stackoverflow.com/a/48516317/9153463
Hello, in your previous video I was trying to understand how you came up with the truth table. Which logic gate did you use, AND or OR? Because I am not able to get the understanding of the table. I know for AND, all inputs must be 1 for output to be 1, and for OR, at least one input must be 1 for output to be 1. But some of the outputs are 1 and others are 0 which is confusing
that is a question truth table and has a unique function (its not OR or AND function), thats why we are writing its expression using these forms
please do videos on vlsi . your videos are really useful.
The only question I really have is how do you get the result for the Y on the truth table? Is it just made up? I thought the values are determined by some circuit?
My bro God bless your momma💗❤️
Thank you so much for helping me.. may Allah bless you..
Thank you for the lecture. I don't see the quizzes after lesson 12. Please tell me where the quizzes. Thank you very much.
Did you find the quizzes?
Thank you so much 🥰
This is a good video.Thank you sir
Budo is really enjoying class...he's been barking throughout
Short but strong video 😊☺
How did you get the output Y in the truth table? is it randomly put the output? or to get the output Y, we need to do any operation? like using OR gate, AND gate or what?
It's random ^_^
Followed these videos when I was studying in my college a few years back & fast forward a few years now when I am teaching a couple of lads the same stuff, I was going through these videos again - and one thing struck me this time - & I hope this helps all who comes to study from Neso: (I tried to make it so that the redundancy theorem doesn't look like it is applicable for only 3 variables - and we will be able to apply it to >3 variables)
Firstly, what is a consensus term?
Consider 2 terms : AB , A’C
The consensus or resolvent of these 2 terms is BC. How?
A consensus term is the conjunction of all the unique literals of the terms, excluding the literal that appears non-negated in one term and negated in the other.
Another example: (a + b + c’).(a+b+d’).(b+c+d’)
a appears in 1st & 2nd term -> both non-negated
b appears in 1st, 2nd, 3rd term -> all non-negated
c appears in 1st & 3rd term -> negated in 1st, non-negated in 3rd
d appears in 2nd & 3rd term -> negated in both
The consensus term for these 3 will be => all the terms apart from c / c’ = (a+b+d’)
or,
Consensus of the 1st & 3rd terms in this example is the 2nd term
The redundancy / consensus theorem states, a consensus term is redundant when it co-exists along with its constructing terms.
So, in the expression: ab + a’c + bc , bc is redundant
little did those dogs know their barks would be heard by millions of ears.
NESO Academy, you beauty.
Thanks Sir 😀😀
🙏 thank you
Thank u so much.....very Helpful videos.......
This is awesome!
Thanks sir 😊 very nicely explain
Nice sir keep it up
sir you are king
Thank you ☺️
how did u get the Y value in truth table..random or by any logical operation??
Same confusion with me bro..
If u know then introduce me
It's random
🔥🔥🔥
Thx a lot Neso Academy
I have a question in the minutes 9:43, how this law you apply it here ? I Couldn't understand it, Can you help me ?
lets take B = X and B'+C' = Y now
=> (A+X).(A+Y)
=> A+(X.Y)
=> A+ [B.(B'+C')]
ok.
@hbose4989 THANKS BUDDY!!!! I WASTED 1HR FINDING THIS FROM GOOGLE🥲..... AFTER THAT I FOUND YOUR REPLY
@@subhashbose4989
Thanks buddy was stuck for minutes.
Did a great job
When values are equal (0& 1) both having same number of high and low , that time which form to be used SOP/POS ????
amazing broo thanks it helped me alooooot
sir the table used in the question. Is it specfic for that question ? or do we have to memorize it?
Can you tell me how did you apply the distributive law @9:38 second??
He made a distributive law mistake
Yaa we didn't understand there
This is absorption law not distributive law
good explanation
do you have analog communication vedios..?
if not prefer any channel for that..?
all after 8:59 seems all wrong to me
Self referential note: SOP - POS interconversion re De Morgan law ta khali canonical form re use kariheba,minimal form re nuha
Can you tell me how do you get the results in truth table from different values of A,B,C variable ???
why can't we stop at y=A+BC'?
why should you go for distributive law again?
This is because there he was trying to derive the minimal POS form of the function. A+BC' is the minimal SOP, but applying Distributive law on it makes it (A+B).(A+C') which is the minimal POS.
@@sonalsrivastava9064 Great, thank you. You remind me of my whole B.E again
@@girisht1936 Well what are you doing now!!?
thank u so much..
How did you find truth table in the last question as it was not given in the question? Can you explain?
max term min term logiK
No logic there just when we write it wich one take less space A.B.C is minterm and wich takes large space is maxterm A+B+C
A+B+C maxterm
A.B.C minterm
Thank you very much.
Its called min term because of its satisfiability.Not because of its size.
more people have heard those dogs barking or that car honking than will ever hear my voice. or the voice of most of yall in the comments. Isn't that weird? I hope neso gets quieter videos in the future. I know this was around a decade ago so he has probably improved his recording since this video.
I think maxterm and minterm are because of nature of output from boolean expression (most of the time maxterm has high output whereas minterm has low output)
I think there's a better reason...
see this and lemme know if I'm correct.
stackoverflow.com/a/48516317/9153463
dog sound background from 6:40
you are a genius:)
In the form (A+BC'), we have 2 gates(1 OR &1 AND) and in the form {(A+B).(A+C')}, we have 3 gates(2 OR & 1 AND), then why the form {(A+B).(A+C')} is called the minimal form!? .......{in the example given in this video}
EXACTLY....I WAS DOING IT RIGHT NOW AND FOUND THIS....I THINK HE FORGOT TO GO FURTHER BY USING DISTRIBUTIVE LAW IN OTHER WAY
10:31 i might the minimal pos is A+B.C' NOT (A+B). (A+C')
It is brother
(abc)' in demorgan formula
The more I watch these videos the more I realize how dumb my professors are... Thank you..!
Your professors may not be necessarily dumb, they just don't know how to explain it clearly like the way it is explained here.
@@plain_and_simple I think they are dumb...
@@het314 youtube videos are just edited, maybe he had repeated this video a million times.
What is the relation between sop and pof form ?
I got confused with this.can you please clear me sir ?
Watching one night before end sem. 😅
excellent
Why aren't 4 terms being used in the conversion to SOP? The A' B C' value also fits the condition for Y'. Should it not be included?
Love you Bro
sir please answer to my question.
simplify using K map with the dont care condition into POS form
F(A,B,C,D)=SUMATION(1,3,7,11,15)
d(A,B,C,D)=Sumation(0,2,5)
sir if u dont have time you can give me the funnction as answer. I have done but i am confused
Did you get the answer as :
ABD'+C'D' or C'D'
It's been 2 yrs you would have got the answer.
Tquuuu so much sir
thanks a lot
The Y column can have any values ?
It's depends on the numbers given in the qn
How do you write the output of corresponding variable A&B please explain
(A+B+c( complement)).(B( complement)+c) what is next how to use a distributive law
Sir can you please explain what the operation are apply in the truth table to get Y plzz sir
Can you please number the videos. For example: 01. Introduction to digital electronics, just like that coze it helps in searching videos when we have downloaded them. Thank you.
True it will be helpful
Kal to meri exam hai bhai 😁🥲
Si how can we write output Y
thanks sir
Why we are not using Reduncy theorem for this (A+B+C)(A+B+C')(A+B'C')
Plz explain neso academy
In redundancy theoem each variable is repeated twice.,but in this problem variables are repeated trice a time
Can we write pos from sop if we let the high o/p (at 3:39) . How?
my doubt is on what basis have you taken the truth table in this as well as last one because when i verified , the output depends on the no. of inputs which is more . if high input is more, output is higher and the vice versa . please clear this out.
It is taken randomly to explain the concept.
The Indian English is too spicy!
Sir what is the difference between canonical and standard forms
It is the same
how are you able to generate the value of the output?? its the only thing I seem not to understand please!!
how are u deciding Y's value sir
How you wrote Y as output...in this POS form?? How to do it? I mean what to do so that we get this output?
Y is randomly taken variable as output.
Put O in the numbers given
POS expression of A B C+A B' C'+A B' C+A B C'+A' B' C. I need an answer for this..
it's maxterms of SOP form
Y = (A+B+C).(A+B'+C').(A'+B+C).(A'+B+C') THATS YOUR ANSWER OR
Y = pi(M0,M3.M4,M5)
Y = piM(0,3,4,5)
Why are you not teaching pos form in middle why ur are teaching sop form pls give clarity
Thaaaaank you!!
thanks.
The expression that u derived of SOP doesn't match with the POS already written .
The first max term isn't the same?
U need my spectacles🤓