Scribd
Upload
34 views3 pages

Tuto 2

Terbaikkk

Uploaded by

ANAS ZUHAIRI BIN ZULLKEFFLE
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
34 views3 pages

Tuto 2

Terbaikkk

Uploaded by

ANAS ZUHAIRI BIN ZULLKEFFLE
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

PLT 106 DIGITAL ELECTRONICS

TUTORIAL 2

1. Subtract 18510 from 23010 by converting to binary. Show your calculation clearly using 2’s
complement form.

2. Convert each pair of decimal numbers to 8 bit binary and add using the 2’s complement
form.
(i) 33 and 15
(ii) 56 and -27

3. Given X = (EF) 16 and Y = (AB) 16 , Compute X+Y and X-Y using 8-bit two's complement
binary arithmetic. State your answer in decimal number system

4. Simplify each equation by using Boolean and DeMorgan theorem.

(i) Z = ( A + B)( A + B + D) D

(ii) X = ( B + C )( B + C )( A + B + C )

5. Simplify each equation by using Boolean and DeMorgan theorem.

(i) Z = ( A + BC + CD ) + BC

(ii) Y = ( A + B)(C + D)( E + F )(G + H )

6. Convert the following Product of Sum expression to minimum Sum of Product expression
using a Karnaugh Map.

F = ( A + B)( A + B + C)(B + C + D)( A + B + C + D)

7. Convert the following Boolean expression into standard POS form and develop a truth
table for this expression:
__ __
F ( A, B, C , D ) = A B C ( B + C D ) + A C + BC

PLT 106 _Digital Electronics_Tutorial 2 1


8. Sketch the logic circuit represented by this equation.

F = ( XYZ )( X + Y )( X + Z )( XY + Z )
9. Simplify the logic function in the Table 1 by using Karnaugh Map to implement the
minimum Sum of Product expression and sketch a logic circuit based on your answer obtained.

Table 1

Inputs Output
(Masukan) (Keluaran)
A B C X
0 0 0 1
0 0 1 1
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 1

10. Use a Karnaugh map to minimize the following Sum of Product (SOP) expression:

F = BCD +ABCD + ABCD + ABCD + ABCD + ABCD + ABCD + ABCD + ABCD

11. Simplify each equation by using Boolean and Demorgan theorem.

(i) Z = AC ( ABD ) + ABC D + ABC

(ii) W = AB (CD + EF )( AB + CD )

12. Simplify each equation to minimum sum of product (SOP) form by using Karnaugh map.

(i) X = ABC + ABC + ABC + ABC

(ii) Y = AC [ B + B( B + C)]

13. Draw the logic circuit for Z = ABC + AB( AC ) .Simplify using Boolean and Demorgan
theorem and draw the simplification circuit.

PLT 106 _Digital Electronics_Tutorial 2 2


14. Simplify the combinational logic circuit to a minimum form.

X
B
C

15. Two (2) Boolean functions are given as:

F4 (A, B, C, D) = ΠM (1, 5, 6, 7, 11, 12, 13, 15)

F5 (A, B, C, D) = ΠM (0, 1, 5, 7, 10, 12, 13, 14, 15)

F6 is obtained by ANDing together F4 and F5 as follows;

F6(A, B, C, D) = [F4(A, B, C, D) . F5 (A, B, C, D)]

Use Karnaugh Map to obtain the simplified expression in the Product of Sum (POS)
form for the function F6(A, B, C, D). Then, construct the logic circuit.

Hint : M = maxterm for POS


M = minterm for SOP

PLT 106 _Digital Electronics_Tutorial 2 3

You might also like