Video describing how to obtain the sum of products and product of sums representations of a Boolean function, itself derived from a Boolean expression.
Жүктеу.....
Пікірлер: 15
@furkancolak37024 жыл бұрын
Low resolution but HIGH explanatory. Thank you very much!
@nabaggalagift58632 жыл бұрын
Thanks. The video was really helpful.
@piperbatey31265 жыл бұрын
Thank you so much for this video! You explain it so well and I feel like I really understand it now.
@rubyPWNS13 жыл бұрын
Eyvallah baba.
@terminatortscc19 жыл бұрын
Sir! you are awesome!
@chri30416 жыл бұрын
Could you explain why the canonical representation is useful and give an example of where it might be used?
@SunRaven
3 жыл бұрын
When you have truth table - description of a function - and you want to come up with the formula that computes the same boolean function - we know what we want a certain unit to do - but then we want to actually compose it from primitive gates - this is how we get from truth table (description of a function) to the most optimal logical gate setup that represents it. ^_^ . Check this video: coursera.org/share/9b84d538ad5c6533efddcc0da885c0c0
@zarok3258 жыл бұрын
Thank you very much :D!
@kasunjalitha23003 жыл бұрын
Thank you!
@patrick72877 жыл бұрын
Thank you sir it was easy to understand 👏🏾
@bird93 жыл бұрын
THANKS !
@Musica-zt6ov Жыл бұрын
neat
@rashmipatange17706 жыл бұрын
Best... nice explanation.... great video... understood fully.... thank u so much Sir....
@habib54816 жыл бұрын
its product ( disjunction ) and sum (conjunction) but great vid
Пікірлер: 15
Low resolution but HIGH explanatory. Thank you very much!
Thanks. The video was really helpful.
Thank you so much for this video! You explain it so well and I feel like I really understand it now.
Eyvallah baba.
Sir! you are awesome!
Could you explain why the canonical representation is useful and give an example of where it might be used?
@SunRaven
3 жыл бұрын
When you have truth table - description of a function - and you want to come up with the formula that computes the same boolean function - we know what we want a certain unit to do - but then we want to actually compose it from primitive gates - this is how we get from truth table (description of a function) to the most optimal logical gate setup that represents it. ^_^ . Check this video: coursera.org/share/9b84d538ad5c6533efddcc0da885c0c0
Thank you very much :D!
Thank you!
Thank you sir it was easy to understand 👏🏾
THANKS !
neat
Best... nice explanation.... great video... understood fully.... thank u so much Sir....
its product ( disjunction ) and sum (conjunction) but great vid
@josephmathew671
6 жыл бұрын
Habib no. Product is conjunction