DeMorgan's Theorem Example Problems

preview_player
Показать описание
Sample problems showing how to use DeMorgan's Theorem to simplify Boolean functions. From the Digital Design course.
Рекомендации по теме
Комментарии
Автор

This is the best explanation I have found.

You saved my life during finals

mitchconner
Автор

I watched so many videos to understand this part and do questions but I failed. Lucky enough that I found this video and now I understand this part crystal clearly Thank you so much mam😭

amashasenanayaka
Автор

This is the best explanation i have foumd ❤

yaks
Автор

Why did the ORs separating the parenthesis on the second problem become ANDs, but on the first problem those ORs stayed as ORs?

nextlvlroy
Автор

thansk for saving my ass like crazy
I literally have an exam in 2 hours

rashidvlogs
Автор

Good day Professor. Thank you, however I have some questions. Where do you suggest I write my questions?

ryanrulsur
Автор

Thank you... just to clarify.. can't first one be further simplified to : A’ + C + B?

elizabethmabrey
Автор

In the last example why was the (Y+YZ') written (1+Z')? How is Y+Y a 1?
Thank you

dmguitar