Practice9_3502 - the Boolean algebra • ABC ABC A B • A...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
German University in Cairo Faculty of Media Engineering and Technology Prof. Dr. Slim Abdennadher Introduction to Computer Science , Winter Term 2009-2010 Practice Assignment 9 Exercise 9-1 Use AND, OR and NOT gates to implement the circuits represented by the following two expressions: S = P 0 X 0 Y + P 0 XY 0 + PX 0 Y 0 + PXY C = P 0 XY + PX 0 Y + PXY 0 + PXY Exercise 9-2 Draw a logic circuit that corresponds to each of the expressions shown below: a) AB 0 + A 0 C 0 D 0 + A 0 B 0 D + A 0 B 0 CD 0 b) B 0 + A 0 C 0 D 0 c) ( A 0 + B 0 + C + D 0 )( A + B + C 0 + D ) Exercise 9-3 Simplify the following Boolean expressions to a minimum number of literals using
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: the Boolean algebra: • ABC + ABC + A B • ( A + B ) ( A + B ) • ( A + B + AB )( AB + A C + BC ) • P XY + PX Y + PXY + PXY • ( AB ) ( A + B ) • B + A C + AB • AB + A C + BC 1 Exercise 9-4 Using DeMorgan's laws, express the Boolean expression F = ABC + A C + A B a) with only OR and NOT operations b) with only AND and NOT operations 2...
View Full Document

This note was uploaded on 12/22/2009 for the course CSEN 102 taught by Professor Slim during the Spring '09 term at German University in Cairo.

Page1 / 2

Practice9_3502 - the Boolean algebra • ABC ABC A B • A...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online