Scribd
Upload
605 views

Tarea 2

1. The document discusses demonstrating the validity of Boolean identities using truth tables and simplifying Boolean expressions to a minimum number of literals. 2. It provides examples of drawing logic diagrams to implement Boolean expressions and proving properties about Boolean functions and their complements. 3. The document asks the reader to perform operations on and analyze Boolean expressions and functions, including obtaining truth tables, simplifying expressions, expressing functions in different forms, and proving statements about Boolean algebras.

Uploaded by

Isai Perez
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
605 views

Tarea 2

1. The document discusses demonstrating the validity of Boolean identities using truth tables and simplifying Boolean expressions to a minimum number of literals. 2. It provides examples of drawing logic diagrams to implement Boolean expressions and proving properties about Boolean functions and their complements. 3. The document asks the reader to perform operations on and analyze Boolean expressions and functions, including obtaining truth tables, simplifying expressions, expressing functions in different forms, and proving statements about Boolean algebras.

Uploaded by

Isai Perez
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

1.

2.

Demonstrate the validity of the following identities by means of truth tables:


a.

( x+ y+ z )' =x ' y ' z '

b.

( xyz )' =x ' + y ' + z '

c.

x ( yz)=(xy ) z

Simplify the following Boolean expressions to a minimum number of literals:


a.

( BC ' + A ' D)( A B' + CD ' )

b.

(x+ y + z )(z + y + z)

c.

xy + x (wz+ wz ')

d.

xy z + x yz + x y z + xyz

e.

ABCD+ A ' BD+ ABC ' D

f.

( A' +C)( A' +C ' )( A+ B+C ' D)

g.

A ' B' ( D ' +C ' D ) + B( A + A ' CD)

'

'

'

'

'

'

'

F=wx+ yz

3.

Find the complement of

4.

Given the Boolean functions


a.

6.

and

F2

E=F 1 + F2

FF' =0

F+ F ' =1

, show that
contains the sum of the minterms of

F1

and

F2

G=F 1 F 2

contains only the minterms that are common to of

Draw logic diagrams to implement the following Boolean expressions:


a.

Y = A+ B+ B ' ( A+ C ' )

b.

Y = A (B D)+C '

c.

Y = A+ CD+ ABC

d.

Y =(A C)' +B

e.

Y =(A '+ B ')(C+ D ')

f.

Y =[( A+ B ')(C '+ D)]

The logical sum of all minterms of a Boolean function of n variables is 1.


a.

7.

; then show that

The Boolean function

F1
5.

F1

The Boolean function

F2
b.

'

Prove the previous statement for

n=3.

b. Suggest a procedure for a general proof.


Obtain the truth table of the following functions, and express each function in sum-of-minterms and
product-of-maxterms form:
a.

(xy + z)( y + xz )

8.

b.

x ' z +wx ' y+ wyz ' + w ' y '

c.

(x+ y ' )( y ' + z )

d.

(xy + yz ' + x ' z )( x+ z )

For a Boolean function

F=xy ' z + x ' y ' z +w ' xy + wx ' y +wxy


a.
b.
c.
d.

9.

Obtain the truth table of F.


Draw the logic diagram. Using the original Boolean expression.
Use Boolean algebra to simplify the function to a minimum number of literals.
Obtain the truth table of the function the simplified expression and show that it is the same
as the one in part (a).
e. Draw the logic diagram from the simplified expression, and compare the total number of
gates with the diagram of part (b).
Express the complement of the following functions in sum-of-minterms form:
a.

F( A , B , C , D)= (3,5,9,11,15)

b.

F( x , y , z )= (2,4,5,7)

10. Convert each of the following expressions into sum of products and product of sums:
a.

( AB+C )(B+ C ' D)

b.

x ' + x( x + y ' )( y + z ')

11. Let

S={1,2,3,6 }

and consider

x+ y=mcm ( x , y ) xy=mcd( x , y)
for all

x, y S

. Show that

S ,+,

is a Boolean algebra.

You might also like