Scribd
Upload
34 views2 pages

Sheet 2

This document is an assignment for 2nd year Communication students at Shoubra Faculty of Engineering, Benha University, focusing on Logic Circuits Design. It includes tasks such as demonstrating the validity of Boolean identities using truth tables, simplifying Boolean expressions, drawing logic diagrams, and implementing Boolean functions with various gate configurations. The assignment covers various laws and simplifications in Boolean algebra, requiring students to apply theoretical concepts practically.

Uploaded by

Sayed Ghazal
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
34 views2 pages

Sheet 2

This document is an assignment for 2nd year Communication students at Shoubra Faculty of Engineering, Benha University, focusing on Logic Circuits Design. It includes tasks such as demonstrating the validity of Boolean identities using truth tables, simplifying Boolean expressions, drawing logic diagrams, and implementing Boolean functions with various gate configurations. The assignment covers various laws and simplifications in Boolean algebra, requiring students to apply theoretical concepts practically.

Uploaded by

Sayed Ghazal
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

Shoubra Faculty of Engineering Logic Circuits Design

Benha University 2rd year Communication

Assignment #2
1. Demonstrate the validity of the following identities by means of truth tables:
(a) DeMorgan’s theorem: (x + y + z) ' = x' . y' . z'
(b) The distributive law: x + y . z = ( x + y )( x + z )
(c) The distributive law: x(y + z) = x . y + x . z
(d) The associative law: x + (y + z) = (x + y) + z
(e) The associative law and x . (y . z) = (x . y) . z

2. Simplify the following Boolean expressions to a minimum number of


literals:
(a) x . y + x . y'
(b) ( x + y) . (x + y')
(c) x . y . z + x' . y + x . y . z'
(d) ( A + B) ' . (A' + B')'

3. Reduce the following Boolean expressions to the indicated number


of literals:
(a) A' . C' + A . B . C + A . C' to three literals
(b) ( x' . y' + z) ' + z + x . y + w . z to three literals
(c) A' . B . (D' + C' . D) + B . (A + A' . C . D) to one literal

4. Draw logic diagrams of the circuits that implement the original


and simplified expressions in problem 2.

5. Simplify the following Boolean functions T1 and T2 to a


minimum number of literals:
6. Express the following function as a sum of minterms and as a product of
maxterms
(a) (b + c . d) . (c + b . d)
(b) ( c . d + b' . c + b . d') . (b + d)
(c)(xy + z)(y + xz)
(d) (A' + B)(B' + C)

7. D raw the logic diagram corresponding to the following Boolean expressions


without simplifying them:
(a) B . C' + A . B + A . C . D
(b) ( A + B) . (C + D) . (A' + B + D)
(c) ( A. B + A' . B') . (C . D' + C' . D)
(d) A + C . D + (A + D') . (C' +D)

8. Implement the Boolean function F = x . y + x' . y' + y' . z


(a) With AND, OR, and inverter gates
(b) With OR and inverter gates
(c) With AND and inverter gates
(d) With NAND and inverter gates
(e) With NOR and inverter gates

You might also like