Open study

is now brainly

With Brainly you can:

  • Get homework help from millions of students and moderators
  • Learn how to solve problems with step-by-step explanations
  • Share your knowledge and earn points by helping other students
  • Learn anywhere, anytime with the Brainly app!

A community for students.

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

Mathematics
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

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

Not the answer you are looking for?

Search for more explanations.

Ask your own question

Other answers:

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

Not the answer you are looking for?

Search for more explanations.

Ask your own question