Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

anima

  • 4 years ago

Rewrite the expression xy+z' in terms of bar and the NAND operation

  • This Question is Closed
  1. anima
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    |dw:1334734679026:dw|

  2. anima
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    this is the NAND operation for the que above...please someone help

  3. dumbcow
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    not sure what "bar" represents is this boolean algebra ?

  4. anima
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    if z=1,then z'=0

  5. Romero
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    Can you rewrite it again.

  6. arcticf0x
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    One way could be, to draw it out, convert into NAND equivalents and form the equations.

  7. dumbcow
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    im stuck of course you could be fancy and negate the NAND resulting in original AND operation --> xy +z' = [(xy)']' +z'

  8. arcticf0x
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    I got xy(bar).z(whole bar), sorry i dont know how to put that in latex.

  9. dumbcow
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    arctic is that NAND(x,y) and z' ? it wont work for all values of 1 x=y=z=1 yields xy+z' = 1 (xy)'z' = 0

  10. arcticf0x
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    noh |dw:1334738031932:dw|

  11. anima
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    how did u get this?

  12. dumbcow
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    ahh i see, yes that would work :) good job

  13. arcticf0x
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    @anima Do you know what are NAND equivalents for NOT, AND and OR gates?

  14. arcticf0x
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    If you dont, check this http://en.wikipedia.org/wiki/NAND_logic Then substitute all the NAND forms given to you, then form the expression again. You will yield this.

  15. arcticf0x
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 2

    Another simpler way would be using, Boolean algebra and De Morgan's laws.

  16. anima
    • 4 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    ya Thanx a lot!!!

  17. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy