CS2031 Digital Logic Design--Fall 2021

CS2031:Digital Logic Design

Lecture-3
Boolean Algebra ,Logic Gates
and Logic Functions
Muhammad Adnan
Assistant Professor
muhammad.adnan@umt.edu.pk

Department of Computer Science,

University of Management and Technology
Outline of Chapter 2
• 2 Boolean Algebra and Logic Gates
• 2.1 Introduction
• 2.2 Basic Definitions
• 2.3 Axiomatic Definition of Boolean Algebra
• 2.4 Basic Theorems and Properties of Boolean Algebra
• 2.5 Boolean Functions
• 2.6 Canonical and Standard Forms
• 2.7 Other Logic Operations
• 2.8 Digital Logic Gates
• 2.9 Integrated Circuits

CS2031 Digital Logic Design--Fall 2021

Boolean Algebra
• Boolean expression: a expression formed by
binary variables, for example, DX  A
• Boolean function: a binary variable identifying the
function followed by an equal sign and a Boolean
expression for example

L( D, X , A)  DX  A

CS2031 Digital Logic Design--Fall 2021

Table 2.1 Postulates and
Theorems of Boolean Algebra

CS2031 Digital Logic Design--Fall 2021

Summary Boolean & DeMorgan’s Theorems

1) X 0  0 10A) XY  Y  X
Commutative
2) X 1 X 10B) XY Y  X Law

3) XX X 11A) XYZ   XY Z

Associative
4) XX0 11B) X  Y  Z   X  Y   Z Law

5) X0 X 12A) XY  Z   XY  XZ

Distributive
6) X  1 1 12B) X  Y W  Z   XW  XZ  YW  YZ Law

7) XXX 13A) X  XY  X  Y
8) X  X 1 13B) X  XY  X  Y
Consensus
9) XX 13C) X  XY  X  Y Theorem

13D) X  XY  X  Y
14A) XY XY
DeMorgan’s
14B) X Digital
CS2031 Y  Logic
X YDesign--Fall 2021
Table 2.7 Truth Tables for the 16
Functions of Two Binary Variables

CS2031 Digital Logic Design--Fall 2021

Table 2.8 Boolean Expressions for
the 16 Functions of Two Variables

CS2031 Digital Logic Design--Fall 2021

FIGURE 2.5 Digital logic gates

CS2031 Digital Logic Design--Fall 2021