Scribd
Upload
63 views2 pages

CC442 Sheet 3

This document contains an assignment for a digital logic design course. It includes problems asking students to simplify Boolean expressions using Boolean algebra rules and Karnaugh maps. It also contains problems where students are given logic circuits and truth tables and asked to find the Boolean expression for the output and simplify it.

Uploaded by

MuhamdA.Badawy
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
63 views2 pages

CC442 Sheet 3

This document contains an assignment for a digital logic design course. It includes problems asking students to simplify Boolean expressions using Boolean algebra rules and Karnaugh maps. It also contains problems where students are given logic circuits and truth tables and asked to find the Boolean expression for the output and simplify it.

Uploaded by

MuhamdA.Badawy
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/ 2

ARAB ACADEMY FOR SCIENCE AND TECHNOLOGY

COLLEGE OF ENGINEERING AND TECHNOLOGY

COMPUTER ENGINEERING DEPARTMENT

COURSE: CC216 DIGITAL LOGIC DESIGNS


ARAB ACADEMY FOR SCIENCE AND TECHN
INSTRUCTOR: COMPUTER ENGINEERING STAFF
COLLEGE OF ENGINEERING AND TECHNO

COMPUTER ENGINEERING DEPARTME


SHEET #3

COURSE: CC442 Digital Design and Intro. To Microprocessor


1. Simplify using Boolean Algebra Rules:
INSTRUCTOR: DR. Hany Hanafy

A B C D + ( A + B + C) + A B C D
ASSIGNMENT #4
A B C + ( A + B) ( B + C + AB)
1) Simply the following expressions using Boolean algebra and DeMorgan's the
a) =( + )( + )
b) =( + ̅ ) ̅
c) = +( ̅+ ) +
d) = ̅ +( + )+
e) = + ( )+( )

2) Simpify thefollowing
2. Given the following
Booleanexpressions
expression: using Karnaught map method to get eithe
minimum POS.
a) = ( + + )( ̅ + ) BC + AB + AC + ABC
b) = ( + )( ̅ + + )( + + ̅ )
c) = i.̅ Simplify
̅ + ̅ using ̅ Boolean
+ algebra
+ rules.
̅
d) + the̅ corresponding
= ii. + Sketch ̅ truth table of the simplified logic.

3) Simplfy the following truth tables using Karnaught maps:


3. Given the following logic circuit:
a)
A B C F
0 0 0 1
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 0
1 i. 1 Find 0 0 Expression of the output X.
the Boolean
1 1 1 0
ii. Simplify X using Boolean Algebra Rules.
b)
A B C F
0 0 0 0
4. Given the following logic circuit:

i. Find the Boolean Expression of the output X.


ii. Simplify X using Boolean Algebra Rules.

You might also like