tugas 5 digital

FULL ADDER

Full adder adalah penjumlahan penuh dimana 3 buah input ( A B C )atau lebih dengan 2 buah output, dimana Sum ( S ) dan Carry ( Cn ). Full adder biasanya dapat menjumlahkan banyak bilangan biner dimana 8, 16, 32, dan jumlah bit biner lainnya. Pada Sum digunakan gerbang logika Ex-OR dan pada carry digunakan gerbang logika AND dan menggunakan gerbang logika OR untuk menjumlahkan tiap-tiap carry.

Tabel Kebenaran :

C	B	A	A (+) B	S	AB	(A (+) B) C	Cn
0	0	0	0	0	0	0	0
0	0	1	1	1	0	0	0
0	1	0	1	1	0	0	0
0	1	1	0	0	1	0	1
1	0	0	0	1	0	0	0
1	0	1	1	0	0	1	1
1	1	0	1	0	0	1	1
1	1	1	0	1	1	0	1

Persamaan Logika :

Sum ( S ) =A (+) B (+) C

Carry ( Cn ) = AB + (A (+) B) C

Gambar Rangkaian :

tugas 4 digital

1. Hukum Aljabar Bolean

1.


2.


3.


4.


5.


6.


7.


8.


9.


10.


11.



2. Soal

1. Give the relationship that represents the dual of the Boolean property A + 1 = 1?(Note: * = AND, + = OR and ' = NOT) A * 1 = 1

• A * 0 = 0
• A + 0 = 0
• A * A = A
• A * 1 = 1

2. Give the best definition of a literal?

• A Boolean variable
• The complement of a Boolean variable
• 1 or 2
• A Boolean variable interpreted literally
• The actual understanding of a Boolean variable

3. Simplify the Boolean expression (A+B+C)(D+E)' + (A+B+C)(D+E) and choose the best answer.

• A + B + C
• D + E
• A'B'C'
• D'E'
• None of the above

4. Which of the following relationships represents the dual of the Boolean property x + x'y = x + y?

• x'(x + y') = x'y'
• x(x'y) = xy
• x*x' + y = xy
• x'(xy') = x'y'
• x(x' + y) = xy

5. Given the function F(X,Y,Z) = XZ + Z(X'+ XY), the equivalent most simplified Boolean representation for F is:

• Z + YZ
• Z + XYZ
• XZ
• X + YZ
• None of the above

6. Which of the following Boolean functions is algebraically complete?

• F = xy
• F = x + y
• F = x'
• F = xy + yz
• F = x + y'

7. Simplification of the Boolean expression (A + B)'(C + D + E)' + (A + B)' yields which of the following results?

• A + B
• A'B'
• C + D + E
• C'D'E'
• A'B'C'D'E'

8. Given that F = A'B'+ C'+ D'+ E', which of the following represent the only correct expression for F'?

• F'= A+B+C+D+E
• F'= ABCDE
• F'= AB(C+D+E)
• F'= AB+C'+D'+E'
• F'= (A+B)CDE

9. An equivalent representation for the Boolean expression A' + 1 is

• A
• A'
• 1
• 0

10. Simplification of the Boolean expression AB + ABC + ABCD + ABCDE + ABCDEF yields which of the following results?

• ABCDEF
• AB
• AB + CD + EF
• A + B + C + D + E + F
• A + B(C+D(E+F))

TUGAS 3

1. Buat tabel kebenaran untuk gerbang XOR 3 , 4 dan 5 input, jelaskan kesimpulan anda

GERBANG XOR

Symbol gerbang xor

Apabila input A dan B ada dalam keadaan logika yang sama, maka output Q akan menghasilkan logika 0, sedangkan bila input A dan B ada dalam keadaan logika yang berbeda maka output akan menjadi logika 1

a. TTabel kebenaran dengan 3 input

Input A	Input B	Input C	Output Q
0	0	0	0
0	0	1	1
0	1	0	1
0	1	1	0
1	0	0	1
1	0	1	0
1	1	0	0
1	1	1	1

b. TTabel kebenaran dengan 4 input

Input A	Input B	Input C	Input D	Output Q
0	0	0	0	0
0	0	0	1	1
0	0	1	0	1
0	0	1	1	0
0	1	0	0	1
0	1	0	1	0
0	1	1	0	0
0	1	1	1	1
1	0	0	0	1
1	0	0	1	0
1	0	1	0	0
1	0	1	1	1
1	1	0	0	0
1	1	0	1	1
1	1	1	0	1
1	1	1	1	0

c. TTabel kebenaran dengan 5 input

Input A	Input B	Input C	Input D	Input E	Output Q
0	0	0	0	0	0
0	0	0	0	1	1
0	0	0	1	0	1
0	0	0	1	1	0
0	0	1	0	0	1
0	0	1	0	1	0
0	0	1	1	0	0
0	0	1	1	1	1
0	1	0	0	0	1
0	1	0	0	1	0
0	1	0	1	0	0
0	1	0	1	1	1
0	1	1	0	0	0
0	1	1	0	1	0
0	1	1	1	0	1
0	1	1	1	1	0
1	0	0	0	0	1
1	0	0	0	1	0
1	0	0	1	0	0
1	0	0	1	1	1
1	0	1	0	0	0
1	0	1	0	1	1
1	0	1	1	0	1
1	0	1	1	1	0
1	1	0	0	0	0
1	1	0	0	1	1
1	1	0	1	0	1
1	1	0	1	1	0
1	1	1	0	0	1
1	1	1	0	1	0
1	1	1	1	0	0
1	1	1	1	1	1

Kesimpulan

Jika input berjumlah ganjil, maka output bernilai 1, sedangkan jika input berjumlah genap, maka output bernilai 0

2. Lampu jalan akan menyala jika Setiap kali switch On, atau setiapkali Timer On dan Hari gelap