anonymous
  • anonymous
Rewrite the expression xy+z' in terms of bar and the NAND operation
Mathematics
jamiebookeater
  • jamiebookeater
See more answers at brainly.com
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Get this expert

answer on brainly

SEE EXPERT ANSWER

Get your free account and access expert answers to this
and thousands of other questions

anonymous
  • anonymous
|dw:1334734679026:dw|
anonymous
  • anonymous
this is the NAND operation for the que above...please someone help
dumbcow
  • dumbcow
not sure what "bar" represents is this boolean algebra ?

Looking for something else?

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

More answers

anonymous
  • anonymous
if z=1,then z'=0
anonymous
  • anonymous
Can you rewrite it again.
anonymous
  • anonymous
One way could be, to draw it out, convert into NAND equivalents and form the equations.
dumbcow
  • dumbcow
im stuck of course you could be fancy and negate the NAND resulting in original AND operation --> xy +z' = [(xy)']' +z'
anonymous
  • anonymous
I got xy(bar).z(whole bar), sorry i dont know how to put that in latex.
dumbcow
  • dumbcow
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
anonymous
  • anonymous
noh |dw:1334738031932:dw|
anonymous
  • anonymous
how did u get this?
dumbcow
  • dumbcow
ahh i see, yes that would work :) good job
anonymous
  • anonymous
@anima Do you know what are NAND equivalents for NOT, AND and OR gates?
anonymous
  • anonymous
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.
anonymous
  • anonymous
Another simpler way would be using, Boolean algebra and De Morgan's laws.
anonymous
  • anonymous
ya Thanx a lot!!!

Looking for something else?

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