S.O.S. Mathematics CyberBoard

Ok so I have an assignment, and a couple of the problems are constructing XOR operators using only NAND gates for one of the problems, and only AND, OR, and NOT gates for the other problem. I have the latter done, but it seems to be overly complicated and I dont have OR gates at all. I just used a hint that the book gave. Heres the expression that the circuit represents

((x'y)'(xy')')'

This looked much cleaner using bars for NOTs, but I hope you get the picture. Sadly, I don't know how to draw the circuit in here haha. But yea, that expression is what the book says x XOR y equals.

I am a computer science student, not an electrical engineer or computer engineering student, so I've never really done any of this before. Any hints would be much appreciated! Please, no answer though

Draw the truth table for both and see that they give the same outputs, and that proves they're the same.

_________________
(\ /)
(O.o)
(> <)
This is Bunny. Copy Bunny into your signature to help him on his way to world domination

Well I have. They both work, but I didn't use any OR gates in there. And it seems more complicated than just x XOR y

Are you supposed to use at least one or gate? If not, then don't worry about it, if so then just tack on an AND (x OR x') which is true when the regular expression is and false otherwise.

_________________
(\ /)
(O.o)
(> <)
This is Bunny. Copy Bunny into your signature to help him on his way to world domination