[go: up one dir, main page]
Scribd
Upload
17 views1 page

Tutorial-3 Boolean Algebra Logic Gates

The document is a tutorial for a course on Digital Systems and Microprocessors at Jaypee University, focusing on Boolean Algebra. It includes various exercises such as obtaining truth tables, drawing logic diagrams, simplifying Boolean functions, and finding complements of expressions. Additionally, it requires the use of NAND and NOR gates for logic diagrams and includes a timing diagram for signal outputs based on input combinations.

Uploaded by

atharvkadre
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
17 views1 page

Tutorial-3 Boolean Algebra Logic Gates

The document is a tutorial for a course on Digital Systems and Microprocessors at Jaypee University, focusing on Boolean Algebra. It includes various exercises such as obtaining truth tables, drawing logic diagrams, simplifying Boolean functions, and finding complements of expressions. Additionally, it requires the use of NAND and NOR gates for logic diagrams and includes a timing diagram for signal outputs based on input combinations.

Uploaded by

atharvkadre
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/ 1

JAYPEE UNIVERSITY OF ENGINEERING &

TECHNOLOGY
DIGITAL SYSTEMS & MICROPROCESSORS (EC110)
TUTORIAL

Topic: Boolean Algebra

Q.1 For the following Boolean functions:


a) F1 = xyz’ + x’yz + xyz + x’yz’
b) F2 = A’B(D’+ C’D) + B (A + A’CD)
c) F3 = (A' + C)(A' + C')(A + B + C'D)
(i) Obtain the truth table.
(ii) Draw the logic diagram using the original Boolean function.
(iii) Use Boolean algebra to simplify the function to minimum number of literals.
(iv) Draw the logic diagram from the simplified expression.

Q.2 Minimize the following Boolean expression using laws of Boolean algebra:
a. F(A,B) = (A + B)'(A' + B')’
b. F(x,y,z) = x'yz + xz
c. F(A,B,C) = ABC + A’B+ABC’+ AC
d. F(A,B,C) = A’C’+ABC+AC’+AB’
e. F(A,B,C,D) = (BC’ + A’D) (AB’ + CD’)
Q.3 Draw the logic diagram for the following functions :
a) F1 (x,y,z) = xyz’ + x’yz + xyz + x’yz’
b) F2 (A,B,C,D) = A’B(D’+ CD) + B (A + A’CD)
a) F3 (A,B,C,D) = (A' + C)(A' + C')(A + B + C'D)
using i) NAND gate only ii) NOR gate only

Q.4 Find the complement of F = wx + yz; then show that FF’ = 0 and F + F’ = 1.

Q.5 Find the complement of the following expressions:


F = xy' + x'y
F = A'B + CD)E' + E
F = (x' + y + z')(x + y')(x + z)

Q.6 By means of a timing diagram , show the signals of the outputs f and g in Fig.1 as
functions of the three inputs a, b, and c. Use all eight possible combinations of a, b, and c.

Fig.1

You might also like