Boolean Algebra- Rules/Identities/theorems

I am abit curious,
I know its in my best interests to learn all the rules (commutative,associative,de-morgans theorem etcetera etcetera) but seeing as it is I am having trouble with them while doing my assignment 3, do I have to memorize them for the exam or will they be supplied on the tests if needed? Oh and is there a book out there that explains them more clearly than the tutorial letter 501 for instance for the commutative rule, it could say something like the orer in which variables are ORed or ANDed makes no difference....

You will not receive the rules in the exams and you do not have to know the names of the rules, but you must be able to apply them.

Try 'Principles of Computer hardware' by Alan Clemens.

Thanks will get the book before the exams....Its sad that all I think about is how to get through the exam...not the 'rules' practical example...but hey I have to start somewehre right?!!