Digital computer circuits and Gates - Basics of Boolean functions

Gates that can be found in digital computer circuits, actually they are numbers of transistors 1 to 6, but it is known as a one completed unit. The main task of gates is to implement Boolean functions such comparative between two things or more, this is also can be done with multiple input or output values. Gates for instance like ( And ) or ( OR ) and ( NOT ) which their values will be as the binary numbers 0s and 1s in machine language based on logically comparatives (true) and (false) that we have studied in mathematics class.This is example for the true table.

 We set identities for the functions with names ( optional ) mathematically and in programming languages called variables.

Using ( And ) gate :

          

x   y     xy

0   0     0

0   1     0

1   0     0

1   1     1

Using ( OR ) gate:

x   y     x+y

0   0     0

0   1     1

1   0     1

1   1     1