Intro To Object Oriented

Concepts

BY HEMALATHA K N & VEERESH S HATTI

CURATED BY
RAMA
 Analog & digital electronics

 Definition and analaog and digital

 importance of digital electronics in the life and as
computer science engineer
 Recall of basic concepts such as gates, boolean
expression etc


 Learning Outcome

In this module, you will learn

 To Use SOP method to design a logic circuit.
 Simplify Boolean expressions using K-map
 ToUse POS method to design a logic circuit
 ToUse Quine-McClusky tabular method for
simplification of Boolean expression having more
than 4 variables
 To develop simple HDL programs in different
models
 Session Schedule

 8 learning sessions
 Teaching methods
 group learning ,

 peer learning ,

 innovative quiz
 Session 1 – combinational logic circuits

 At the end of this session you will be able to :

 Diagrammatically represent the SOP form

 Simplify the Boolean equation using SOP form
 Describe the logic circuit diagrammatically for the
given simplified equation
 Sum-of-Products (SOP) Method

Product term
 A product term is a conjunction of literals, where
each literal is either a Boolean variable or its
complement.
 Examples: A . B A’ . B. C’ A
Fundamental product or Minterm
 For a function of n variables, a product term in
which each of the n variables appears once
 (in uncomplemented or complemented form) is
called a fundamental product or minterm
 Types of canonical forms
The canonical formulas are of two types
1. Minterm canonical formulas
2. Maxterm canonical formulas
• MINTERM CANONICAL FORMULAS
• Minterms are product of terms which represents the
functional values of the variables appear either in
complemented or un complemented form.
• Ex: f(x,y,z) = x y z + x y z + x y
 The Boolean expression whichis represented above
is also known as SOP or disjunctive formula. The
truth table is
Fundamental Products for Two inputs
 Consider two inputs A and B. The fundamental
products or minterms are listed below:
 Sum-of-Products (SOP) Equation

 Represented by an expression that is a sum of

minterms, where each minterm is ANDed with the
value of Y for the corresponding valuation of input
variables.
 Ex Consider,
Y = m0 . 0 + m1 . 1 + m2 . 1 + m3 . 1
= m1 + m2 + m3
= A’ . B + A . B’ + A . B
 Quick quiz 20
30
28
29
26
24
22
23
25
27
10
18
19
16
14
21
12
13
15
17
11
8
9
6
4
2
3
5
71
 Which of the following expressions is in the sum-
of-products form?
 (A) (A + B)(C + D)
 (B) (AB)(CD)
 (C) AB(CD)
 (D) AB + CD
 Problem

 Suppose three variable truth table has a high output

for these input conditions 000,010,100 & 110. Draw
SOP circuit
 Summary :

 In this Session ,You have learned

 The sop form

 Represntation of data in sop form

 Logic circuit representation in sop form