Tugas 4
Minggu, 18 April 2010
Sabtu, 17 April 2010
1. Give the relationship that represents the dual of the Boolean property A + 1 = 1?
(Note: * = AND, + = OR and ' = NOT)
1. A * 1 = 1
4. A * A = A
5. A * 1 = 1
2. Give the best definition of a literal?
1. A Boolean variable
2. The complement of a Boolean variable
3. 1 or 2
3. Simplify the Boolean expression (A+B+C)(D+E)' + (A+B+C)(D+E) and choose the best answer.
3. A'B'C'
4. D'E'
5. None of the above
4. Which of the following relationships represents the dual of the Boolean property x + x'y = x + y?
3. x*x' + y = xy
4. x'(xy') = x'y'
5. 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:
4. X + YZ
5. None of the above
6. Which of the following Boolean functions is algebraically complete?
3. F = x'
4. F = xy + yz
5. F = x + y'
7. Simplification of the Boolean expression (A + B)'(C + D + E)' + (A + B)' yields which of the following results?
1. A + B
4. C'D'E'
5. 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'?
1. F'= A+B+C+D+E
2. F'= ABCDE
3. F'= AB(C+D+E)
4. F'= AB+C'+D'+E'
9. An equivalent representation for the Boolean expression A' + 1 is
1. A
2. A'
10. Simplification of the Boolean expression AB + ABC + ABCD + ABCDE + ABCDEF yields which of the following results?
1. ABCDEF
4. A + B + C + D + E + F
5. A + B(C+D(E+F))
(Note: * = AND, + = OR and ' = NOT)
1. A * 1 = 1
2. A * 0 = 0
3. A + 0 = 04. A * A = A
5. A * 1 = 1
2. Give the best definition of a literal?
1. A Boolean variable
2. The complement of a Boolean variable
3. 1 or 2
4. A Boolean variable interpreted literally
5. The actual understanding of a Boolean variable3. Simplify the Boolean expression (A+B+C)(D+E)' + (A+B+C)(D+E) and choose the best answer.
1. A + B + C
2. D + E3. A'B'C'
4. D'E'
5. None of the above
4. Which of the following relationships represents the dual of the Boolean property x + x'y = x + y?
1. x'(x + y') = x'y'
2. x(x'y) = xy3. x*x' + y = xy
4. x'(xy') = x'y'
5. 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:
1. Z + YZ
2. Z + XYZ
3. XZ4. X + YZ
5. None of the above
6. Which of the following Boolean functions is algebraically complete?
1. F = xy
2. F = x + y3. F = x'
4. F = xy + yz
5. F = x + y'
7. Simplification of the Boolean expression (A + B)'(C + D + E)' + (A + B)' yields which of the following results?
1. A + B
2. A'B'
3. C + D + E4. C'D'E'
5. 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'?
1. F'= A+B+C+D+E
2. F'= ABCDE
3. F'= AB(C+D+E)
4. F'= AB+C'+D'+E'
5. F'= (A+B)CDE
9. An equivalent representation for the Boolean expression A' + 1 is
1. A
2. A'
3. 1
4. 010. Simplification of the Boolean expression AB + ABC + ABCD + ABCDE + ABCDEF yields which of the following results?
1. ABCDEF
2. AB
3. AB + CD + EF4. A + B + C + D + E + F
5. A + B(C+D(E+F))
Sabtu, 10 April 2010
TUGAS 3
Tugas 3.A
1. Buat tabel kebenaran untuk gerbang XOR 3 , 4 dan 5 input, jelaskan kesimpulan anda
1. Tabel Kebenaran untuk gerbang XOR 3
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 |
2. Tabel Kebenaran untuk gerbang XOR 4
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 |
3. Tabel Kebenaran untuk gerbang XOR 5
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 | 1 |
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 |
Gerbang Logika XOR
Gerbang Logika XOR
Gerbang logika ini hanya akan mengeluarkan hasil output bernilai 1 jika hanya salah satu input saja yang bernilai 1. Maksudnya jika kedua input bernilai 1, maka hasil output-nya tetaplah 0.
KESIMPULAN : Jika Semua Input bernilai SAMA maka Output logika bernilai 0, Output akan benilai 1 jika input yang dimasukkan BERBEDA.output akn belogika 1 jika input berlogika ganjil,dan output akn berlogika 0 jika input berlogika genap.
Tugas 3.B
Lampu jalan akan menyala jika à Setiap kali switch On, atau setiapkali Timer On dan Hari gelap
Tabel Kebenaran :
A | B | C | C’ | Q1 = C’ . B | Q2 = A +( C’ . B) |
0 | 0 | 0 | 1 | 0 | 0 |
0 | 0 | 1 | 0 | 0 | 0 |
0 | 1 | 0 | 1 | 1 | 1 |
0 | 1 | 1 | 0 | 0 | 0 |
1 | 0 | 0 | 1 | 0 | 1 |
1 | 0 | 1 | 0 | 0 | 1 |
1 | 1 | 0 | 1 | 1 | 1 |
1 | 1 | 1 | 0 | 0 | 1 |
Ket : A = Input Switch
B = Input Timer
C = Input light sensor
C’ = Komplemen C (logika NOT)
Q1 = Output logika AND dari C’ dan B
Q 2 = Output logika Q1 + A
Langganan:
Postingan (Atom)