Boolean algebra #24: DeMorgan's theorem - examples

Loading...

Sign in or sign up now!
Alert icon
Upgrade to the latest Flash Player for improved playback performance. Upgrade now or more info.
2,350
Loading...
Alert icon
Sign in or sign up now!
Alert icon

Uploaded by on Oct 12, 2010

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

  • likes, 0 dislikes

Link to this comment:

Share to:

Uploader Comments (keleshevCOM)

  • Hello sir

    I am confused why did you do (A+B+C) + D ? for the first question . Because After (A+B+C) it should be .D isn't it? but where dis "+" sing came before D like this " + D"?

    thank you

  • @AZCHIM Hi, I'm not sure if I understood your question, but in the first example ((A+B+C)D)' where by (...)' I mean negated, we imagine that (A+B+C) is a first term in DeMorgans law, and D is the second. That's how we get (A+B+C)' + D'. it is the same as in (X * D)' = X' + D' but instead of X we have (A+B+C).

  • You're my hero. I am so going to pass this class now. Can't wait to see more.

  • @SDTricker Thanks! I'm so happy that this is useful :-) More stuff coming soon.

see all

All Comments (6)

Sign In or Sign Up now to post a comment!
  • thaks

    

  • Thank you sir

    I was confused on how the sing changes from . to + but I guess it's the rule :D

    I thik I am clear now thank you so much . bless you XD

Loading...

Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more