Logic Gates and Full Adders

Greetings /prog/

I admittedly haven't been here before, haven't even been to this site but I was lingked here from /g/ so... I was wondering if you could give me a hand with something. I'm a first year computer science student (I know I know there's no jobs and it's a waste of time and whatever) and I was looking through some past papers when I came across a question that has me a little perplexed.

The question asked how I would go about building a denary full adder using these logic gates in order (XNOR,NOR,NOT,NAND). Now logic gates and all that related shit are my arch nemesis but I have no fucking clue how this would even work. Is this somethign that's trivially simple and I'm just being dense or is this as puzzling as it seems?

Sorry if these kind of questions are taboo or whatever, I wasn't willing to lurk for a few months before asking.

>>34

It's not my post's fault you do not understand....

I can lead a horse to water, but i can't make it drink....
I can show you the door, but it's you that has to walk through...
..etc?

>>http://c2.com/cgi/wiki?ThreeValuedLogic

>>We should also consider the question of state inversion in ternary systems (as well as 4-state systems and so on). In a binary system, inversion is trivial - not 0 is 1, not 1 is 0. In three-value logic, inversion (!) is not necessarily as simple as claimed above. The inversion of 0 can be either 1 or 2. Inversions are often most useful when they are reversible, so that if !0 = 2, then !2 = 0. This leaves 1 to invert to itself. Another approach, however, has !0=1, !1=2, and !2=0 - this is invertible but not reversible, as !(!0) = 2, not 0. There are 6 reversible ternary inverters (including the identity).


>>is invertible but not reversible,
=) Left-handed // Right-handed Op's? ...Reversed enough>?>
if (!)0=2 (i)2=0

Its Cyclic-3 anyway

!(!(!0))) = 0 .... !!! Not !! .....