Scribd
Upload
7 views

Logic Lab2

Uploaded by

engmenna743
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
7 views

Logic Lab2

Uploaded by

engmenna743
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Mansoura University

Faculty of Computers and Information science.


Information Technology Department.
Course: Digital Logic Design
Code: [IT124P]
First Year

LAB 02:
Boolean Algebra

LAB Objectives
The goal of this lab is to study and verify formulation of Boolean function. After
completing this lab:
• They understand formulation of Boolean function and truth table for logic
circuits.
• They understand the simplifying method using Boolean algebra law.
LAB Content
1. Basic Laws and Theorems for Boolean Algebra

1
Mansoura University
Faculty of Computers and Information science.
Information Technology Department.
Course: Digital Logic Design
Code: [IT124P]
First Year

➢ Demonstrate the validity of the following identities by means of


truth tables:
a) DeMorgan’s theorem for three variables: (x + y + z)' = x'y'z' and
(xyz)' = x' + y' + z'.
b) The associative law and x(yz) = (xy)z

b) The associative law and x(yz) = (xy)z

2
Mansoura University
Faculty of Computers and Information science.
Information Technology Department.
Course: Digital Logic Design
Code: [IT124P]
First Year

▪ Simplify the following Boolean expressions to a


minimum number of literals:
a) a'bc + abc' + abc + a'bc’
b) (A + B)' (A' + B’)’
c) (a + b + c')(a' b' + c)
d) A’C’ + ABC + AC’

Ans:
(a) ab(c+c`)+a`b(c+c`)= b(a+a`)=b
(b) A`B`.AB=0
(c) aa`b`+ac+ba`b`+bc+c`a`b`+c`c = ac+bc+a`c`b`
= a`b`c`+c(a+b)
(d) A’C’ + AC’ + ABC = C’(A’+ A) + ABC
= C’∙1 + ABC
= C’ + ABC

3
Mansoura University
Faculty of Computers and Information science.
Information Technology Department.
Course: Digital Logic Design
Code: [IT124P]
First Year
= (C’+ AB)(C’+C) [distributive]
= AB + C’

Homework 02:
Student Name
Student ID
Section
Dept.
Year
Date

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


(a) xy + xy'
………….………..…………………………………………………………………………………………………………………………….

……………………………………………………………………………………………………………………………………………………

(b) (x + y) (x + y')
………….………..…………………………………………………………………………………………………………………………….

……………………………………………………………………………………………………………………………………………………

(c) xyz + x'y + xyz'


………….………..…………………………………………………………………………………………………………………………….

……………………………………………………………………………………………………………………………………………………

(d) a'bc + abc' + abc + a'bc'


………….………..…………………………………………………………………………………………………………………………….

……………………………………………………………………………………………………………………………………………………

(e) ABC + A'B + ABC'


………….………..…………………………………………………………………………………………………………………………….

……………………………………………………………………………………………………………………………………………………

4
Mansoura University
Faculty of Computers and Information science.
Information Technology Department.
Course: Digital Logic Design
Code: [IT124P]
First Year

(f) (BC' + A'D) (AB' + CD')


………….………..…………………………………………………………………………………………………………………………….

……………………………………………………………………………………………………………………………………………………

2. Draw logic diagrams of the circuits that implement the original and
simplified expressions in Problem 1.b.

………….………..…………………………………………………………………………………………………………………………….

……………………………………………………………………………………………………………………………………………………

………….………..…………………………………………………………………………………………………………………………….

……………………………………………………………………………………………………………………………………………………

………….………..…………………………………………………………………………………………………………………………….

3. Find the complement of the following expressions:


a) xy' + x'y

………….………..…………………………………………………………………………………………………………………………….

……………………………………………………………………………………………………………………………………………………

……………………………………………………………………………………………………………………………………………………

b) (A 'B + CD) E' + E


………….………..…………………………………………………………………………………………………………………………….

……………………………………………………………………………………………………………………………………………………

………….………..…………………………………………………………………………………………………………………………….

You might also like