Boolean algebra #25: DeMorgan's theorem - examples (continued)

visit www.keleshev.com/ for structured list of tutorials on Boolean algebra and digital hardware design!

[@teambacon]

thanks, you helped in 5 minutes with something I've been struggling to understand for a semester. Will recommend you

[@Kever1835]

Thanks alot! Found your website very useful, very clear explaination and it helped me alot! Thanks for taking the time spread your knowledge in such a simplified and understandable form.

[@boganza5140]

Man I'm coming to this video after 10 years of upload date and still there is no video better than this on youtube since 10 yrs....the man who made this video might be dead till now😂

[@keleshevCOM]

@mwoddo, @00Gravity, There are two ways of simplifying (C' + (CD)')' [mind that it's (CD)' and not C'D']. First way to apply DeMorgans for the whole expression first: (C' + (CD)')' = C'' * (CD)'' = CCD = CD [as I did in the video], The other way is to apply DeMorgans on (CD)' first [as you, guys, propose]: (C' + (CD)')' = (C' + C' + D')' = CCD = CD In both case the result is the same.

[@UnseenOct]

THANK YOU! I was almost in tears trying to figure this out from my textbook lmao

[@keleshevCOM]

@Morelloo1 To represent your function with only use of complement (negation) and OR (+ sign) but without AND (multiplication sign) I would double-negated every term and applied DeMorgan's theorem to them: ABC' + BC + C'D = (negate twice every term) ((ABC')')' + ((BC)')' + ((C'D)')' = (applying DeMorgans thorem) (A' + B' + C)' + (B' + C')' + (C +D')' no multiplication in this one! Hope I explained ok.

[@RajKumarrajkuttie]

thanks sir

[@mimimi3440]

thank you another really usefull video for de morgans theorem , i solved them all for boolean simplification really usefull for me

[@dinel6176]

Svaka cast braca

[@smalltugz]

break the line then change the sign

[@moazelsawaf2000]

I liked it ❤👍

[@abualasif]

Hey there, are you still alive?

[@GiDoRu90]

hi, I watched til now every video til 25 ; ) and first of all! You are awesome! Without you I probably wouldn't pass my Computer Science examination. But I have one question: In the second line you "add brackets" to (A'+B)*(B'(C'+(CD)')'). How do you define these Brackets? I did the task before I finished the video to practise and I got exactly the same result, but I did't have brackets, so I couldn't open them! Best Gio from Germany!

[@abualasif]

Hey there, are you still alive?

[@MrAloke7]

can u tell me that which operation perform first in the boolean expression A + ( B.C ) { there is a bar above B.C ] ? the option i got in the question are a ) AND b ) OR c ) NOT d ) All of them .

[@karelminichbauer8483]

Thanks very helpfull. Good job

[@mimimi3440]

break the line and change from or to and gate remember double negetion is the initial literal

[@geetamohanty5657]

thanks a lot sir......

[@03329307679]

A` + b = 1 , can we put 1 in place of A`+Bin Theorm

[@martha-is4du]

how would you simplify this using de morgans Y= A'BC'D'+ABCD+AB'CD'+ABC'D'+A'BCD'+AB'CD+ABCD' ?

[@moazelsawaf2000]

Thanks sir ❤

[@Morelloo1]

I like the video it is very helpful. But I have a question. If we are given a function F = ABC' + BC + C'D (where the ' after the letter is bar) and we need to express the function with only OR and compliment operation and then again with only AND and compliment operation how do we figure out the OR and compliment operation because isn't the original equation already in sum of products form?

[@abualasif]

Hey there, are you still alive?

[@Morelloo1]

@@abualasif yup im alive

[@abualasif]

@@Morelloo1 Wow, great to know. this is a historic moment. 9 years... crazy lol

[@MrsZqiizfiaesy]

All of your tutorial is very2 good.. u explain very well and detailed. thanks a lot. i really appreciate on what you did.thank you so much.. i watched all your video.

[@abualasif]

Hey there, are you still alive?

[@user-bw4lv6zj5b]

thanks arigato gosaimasi oppa mwa mwa chup chup

[@00Gravity]

hello, by (A´+B)(B´+(C´+C´D´)´), why does (C´D´) not become C+D? Is that because of the doble negation whereas by (AB´)´ there´s only one negation of the sign in between? Thank you very much!

[@abualasif]

Hey there, are you still alive?

[@Karma-mk2ne]

thanks i have an exam in an hour

[@JabbaDG]

did you get through?

[@uninor1928]

(A+(B)'+C+D)-(A+(B)'+(C)'-(D)')'=Y please solve it

[@searodrig]

(A'+B) is not the same as A'+A)=1. Perform a truth table on (A'+B) there is a case where the output is not always 1.

[@JOSHWASOG]

u made a mistake in the 3rd to last line where u have (not A+B) = not(A.B) it should be ( A.not B)

[@Chokoia]

WRONG!

[@Chokoia]

lol j/k

[@awuakate3757]

@keleshevCOM , in your example in this tutorial (A'B')+A'CD+BCD, could be simplify as (A'B')+CD(A'+B) //(A'+B) is the same as A'+A=1 ? if is so... the the simplify expression will be (A'+B) + CD is it right? thanks for the tutorial

[@Chokoia]

I got the same thing

[@MrAloke7]

what is word in computer terminology ?

[@Chokoia]

string

[@pradipbhattacharya9972]

MrAloke7 a group of bits

[@angelfernandez5585]

I think the answer is B+ACD+BCD cause it can still simplify the AB +B B (1+A) So the answer is B +ACD +BCD

[@cykatytuberkolsis3761]

He use demorgans theorm in this example

[@abarth0800]

Something happens when you click. I listen to a big bump.

[@hamidhamida5628]

Nule

[@devilgamingforce1090]

your answer is wrong correct ans : A'+CD

[@211manikantasugguna3]

Draw logic gates of this example

[@saeedwiz]

watch this video in x1.25, thank me later.

[@satoshinazarov6257]

WATCH IT in 2x thank ME later

[@jackd9259]

You talk too much