0% found this document useful (0 votes)
25 views

Fakulti Teknologi Kejuruteraan Beta2343 Microprocessor Technology Tutorial 2

This document contains a tutorial on microprocessor technology. It provides examples of combinational logic circuits and asks students to write Boolean expressions, draw truth tables, apply DeMorgan's theorems, simplify expressions using Boolean algebra, and draw simplified logic circuits based on given Boolean expressions. Students are asked to complete these tasks for over a dozen examples of combinational logic circuits and Boolean expressions.

Uploaded by

Suhaila Najib
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
25 views

Fakulti Teknologi Kejuruteraan Beta2343 Microprocessor Technology Tutorial 2

This document contains a tutorial on microprocessor technology. It provides examples of combinational logic circuits and asks students to write Boolean expressions, draw truth tables, apply DeMorgan's theorems, simplify expressions using Boolean algebra, and draw simplified logic circuits based on given Boolean expressions. Students are asked to complete these tasks for over a dozen examples of combinational logic circuits and Boolean expressions.

Uploaded by

Suhaila Najib
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

FAKULTI TEKNOLOGI KEJURUTERAAN

BETA2343 MICROPROCESSOR TECHNOLOGY


TUTORIAL 2

1. Write the Boolean expression and draw the truth table of the circuit:

a. Figure Q1(a)

b. Figure Q1(b)

c. Figure Q1(c)

d. Figure Q1(d)

e. Figure Q1(e)
f. Figure Q1(f)

2. Write the Boolean expression of the circuit:

a. Figure Q2(a)

b. Figure Q2(b)

C X

Implementing Combinational Logic

3. Draw the circuit:

a. X = ABC + D

b. X = A(CD + B)

c. X = AB + AB

d. X = A( B + C )

e. X = ABC + B ( EF + G )
4. Apply DeMorgan’s theorems to the expression:

a. A+ B+C =

b. A( B + C ) =

c. ( A + B )(C + D ) =

d. ( A + B + C + D) + ABC D =

e. ( A + B + C + D )( A B C D ) =

5. Simplify using Boolean Algebra

a. A( A + AB) =

b. ABC + ABC + A BC =

c. ( A + B )( A + C ) =

d. ABC + ( A + B + C ) + ABC D =

e. ( B + BC )( B + BC )( B + D) =

6.

a. Write the Boolean expression of the circuit.

b. Simplify the Boolean expression using Boolean algebra and DeMorgan’s theorems.

c. Draw the simplified logic circuit.

You might also like