Implementation of function by combinational circuit

hello,
I have 2 questions about project 3.

  1. The cost and delay of NOT gate is 1?
  2. Where can i find information about method to build a circuit from a given function? I noticed that you dont teach that in the recitations and lectures and i just work in a method of “trial and error” until i succeed.

Thanks

  1. question 1 has been already answered see Cost and delay of gates
  2. Follows the proof on the completeness of {AND,OR,NOT}. It shows how every function can be expressed by a Boolean formula. This formula can be easily turned into a combinational circuit.