Tugas 4[Ahmad padilah]Gerbang logika

 Gerbang logika dan aljabar boolean

- Sekarang kita telah mengetahui konsep dasar bilangan biner, dan kita akan mempelajari cara menggambarkan bagaimana sistem menggunakan level logika biner dalam membuat keputusan

- Aljabar boolean adalah alat yang penting dalam menggambarkan, menganalisa, merancang, dan mengimplementasikan rangkaian digital

konstanta boolean dan variabls

- Aljabad boolean dibawah ini hanya mempunyai dua nilai : 0 dan 1

- Logika 0 dapat dikatakan : false, of, low, no, saklar terbuka

- Logika 1 dapat dikatakan : true, on, high, yes, saklar tertutup

- Tiga operasi logika dasar : OR, AND, dan NOT

Table kebenaran

-sebuah table kebenaran menggambarkan hubungan antara input dan output sebuah rangkaian logika

-jumlah the number of entries corresponds to the number of inputs. For example a 2 input table would have 2^2=4entries , A3 input table would have 2^3=8 entries. 

Table kebenaran 

Contoh table kebenaran dengan masuka 2,3 dan 4 buah

Operasi OR dengan gerbang OR

-the boolean expression for the OR operation is X=A+B

-truth table and circuit symbol for a two input or gate :

Or operation with Or gates

-the Or operation is similiar to addition but when A=1 and B =1, the or operation produces 1+1=1

Or operation with Or Gates

-there are many examples of applications where an output function is desired when one of multiple inputs is activated

Not operation

-The boolean expression for the NOT operation is X=A

-This is read as

° x equals Not A, or

° x equals the inverse of A, or

° x equals the complement of A

Not operation

- truth table, symbol, and sample wavefrom for the NOT circuit 

Describing logic circuit algebraically

-example of boolean expression for logic circuits 

Describing logic circuits algebraically

-the output of an inverter is equivalent to the input with a bar over it. Input A through an inverter equals A. 

-examples using inverter

Evaluating logic circuits output

°rules for evaluating a boolean expression:

-perform all in version of single terms

-perform all operations within parenthesis

-perform and operation before an or operation unless parenthesis indicate otherwise

-if an expression has a bar over it, perform the operations inside the expression and then invert the result

NOR gates and NAND gates

-combine the basic AND, OR, and NOT operations

-the NOR gate is an inverted Or gate. An in version "bubble" Is placed at the output of the OR gate

-the boolean expression is x=√ A+B

NOR gates and NAND gates

-the NAND gates is an inverted AND gate. AN inversion of the AND gate. 

-the boolean expression is 

SUMBER: https://onlinelearning.uhamka.ac.idhttps://onlinelearning.uhamka.ac.id