2.4 Computation Logic

2.4 Computation Logic

1. Logic gate

   • AND Gate
   • NOT Gate
     • NOT gates have one inputs and one output.
       • NOT gates are represented in Boolean equations using the symbol ¬
     • NOT gates invert the input so their output is the opposite of the input given
       • The logical statement "not A" is represented as ¬ A
   • OR Gate
     • OR gates have two inputs and one output
       • The logical statement "A or B" is represented as A ∨ B
     • O An OR gate will output current (represented as a 1 on the output) if either or both inputs are on (also represented as 1s)

Images and files in the map