(Following tutorial's examples are taken
from book "Computer Fundamentals - Third Edition". Author: Pradeep K
Sinha and Preeti Sinha. Publisher: BPB Publications, New Delhi. Latest
version of this book is available for purchase at: www.bpbonline.com)

30.06.12

The desired logic circuit is shown above, which is self-explanatory.

Example 2: (In book: Example 6.10 Page 80)

The desired logic circuit is shown above, which is self-explanatory.

30.06.12

Last tutorial we have seen the method of deriving Boolean expression for a given logic circuit. The reverse problem of constructing a logic circuit for a given Boolean expression is also not difficult. The three logic gates - AND, OR and NOT are said to be logically complete, because any Boolean expression may be realized using only these three gates. The method of constructing logic circuits for Boolean expressions by using only these three gates, is illustrated below with the help of few examples:

Example 1: (In book: Example 6.9 Page 79)

Construct a logic circuit for the boolean expression A.B+C

This gate is constructed using: 'Logisim'. Download this FOSS from: ozark.hendrix.edu |

Example 2: (In book: Example 6.10 Page 80)

Construct a logic circuit for the Boolean Expression: A.B
+ C.D + E.F

This gate is constructed using: 'Logisim'. Download this FOSS from: ozark.hendrix.edu |

The desired logic circuit is shown above, which is self-explanatory.

Example 3: (In book: Example 6.12 Page: 80)

Construct a logic circuit for the Boolean Expression:

(X
+ Y + Z) . (X + Y)
. (X + Y)

## No comments:

## Post a Comment