Simplification 3: Canonical Forms, Minterms and Maxterms

preview_player
Показать описание
This video series starts at the very beginning and shows each step in the design of modern computing hardware. From bits to gates to registers to CPU. A followup video series will show how the CPU is expanded with modern techniques like cache, pipelining and multiprocessing.
Рекомендации по теме
Комментарии
Автор

This is literally the only resource that I've found that *actually* explains what minterms and maxterms are in an easily understandable way, as well as clearly showing their relevance. I (somehow) managed to get through a dissertation on formal methods without it truly clicking in the way it just has. You're an excellent teacher, thanks for putting this up!

CaptainSlowbeard
Автор

thank god someone`s explaining that in a non indian accent

kaja
Автор

I rarely comment on videos but this is def one of the best videos I've found for digital logics, thank you sm!

johnsonliuu
Автор

This is great! Simple explanations, clean visuals, and a touch of contextual information made this extremely helpful.

putisproductions
Автор

Man, you are a lifesaver.
Helped me before my exam.

rishikeshgkulkarni
Автор

Thank you for the straight forward no-bullshit explanation... I was struggling to understand this and u made it extremely easy.. Thank you again.

islamyahia
Автор

I wish I found you before my midterm 😪 but going to crush this final thanks to you and your videos!! ☺

whis
Автор

superb explanation, because of this video I am able comprehend what minterms and maxterms are truly are. The idea of min and max terms truly a genius work, for me it seems like factoring a function over a basis(of a vector space for functions).

gontusandeep
Автор

You know its extra good when professors are linking the video.

gurpreetkhamba
Автор

Awesome! Thank you for sharing these great videos on YouTube!

joseespericuetapacheco
Автор

Thank you! I like that your explanation is step-by-step and it is easy to understand

aodong
Автор

This is so helpful thank you for taking the time to make these videos!!

jackdempster
Автор

WOW! You are the best teacher. Thank you very much!!!

samsonsisay
Автор

Thank you very much! Digital Logic is a blast, but man some things just need some extra coverage.

tarky_tark
Автор

Thanks a LOT sir <3 very simple and understanding content

faridjafari
Автор

thank you so much! really good explanation

joshua_dlima
Автор

YOU'RE TE BEST I LOVE U WITH EVERY PART OF MY BOOLEAN-SOLVING MIND

themasterproller
Автор

thank you so much, that helped me alot

anujchhetri
Автор

Is there any difference in changing POM to SOM with duality and demorgan's law? Suppose i have POM of (a, b) = M0.M1. Is the SOM m0+m1 (using demorgans) or m2+m3 (using duality)?

AthaillahS
Автор

W rizz bro you're saving my life rn

wilsonchen