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.

Thank you for the help but I feel that I'm missing something fundamental here, whilst I understand the theory I don't understand... oh god this is so fucking hard to word.

I understand how it works with binary because it's all single bits, 1 is true and 0 is false. Is there something I'm missing or would this just involve a lot full adders connected together?

Sorry about this, computer systems/architecture was the module I was least competant at and as such I'm currently trying to improve on it.