Scribd
Upload
409 views

Sum of Product (SOP) Form

The document discusses product of sums (POS) representation of Boolean functions. POS represents a Boolean function as the product of summed variables, where variables are first summed and then the product is applied to the sum terms. For example, (a’+b).(a+b’+c) is a POS expression with variables summed and terms multiplied. It also provides an example of the difference between sum of products (SOP) and POS representations.

Uploaded by

s.lakshmi narasimham
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
409 views

Sum of Product (SOP) Form

The document discusses product of sums (POS) representation of Boolean functions. POS represents a Boolean function as the product of summed variables, where variables are first summed and then the product is applied to the sum terms. For example, (a’+b).(a+b’+c) is a POS expression with variables summed and terms multiplied. It also provides an example of the difference between sum of products (SOP) and POS representations.

Uploaded by

s.lakshmi narasimham
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

POS form

K-map can take two forms Sum of Product (SOP) and Product of Sum (POS) according to
the need of problem. K-map is table like representation but it gives more information than
TRUTH TABLE.

POS (Product of Sums) is the representation of the boolean function in which


the variables are first summed, and then the boolean product is applied in the
sum terms. For example, (a’+b).(a+b’+c) is POS expression where we can see
that the variables are added then each bigger term is the product of the other.

---------------
Sum of Product (SOP) Form
The sum-of-products (SOP) form is a method (or form) of simplifying the Boolean
expressions of logic gates. In this SOP form of Boolean function representation,
the variables are operated by AND (product) to form a product term and all these
product terms are ORed (summed or added) together to get the final function.

Difference between SOP and POS :


S.No
. SOP POS

A way of representing boolean A way of representing boolean


expressions as sum of product expressions as product of sum
1. terms. terms.

SOP uses minterms. Minterm is POS uses maxterms. Maxterm is


product of boolean variables sum of boolean variables either
either in normal form or in normal form or complemented
2. complemented form. form.

It is sum of minterms. Minterms It is product of maxterms.


3. are represented as ‘m’ Maxterms are represented as ‘M’

SOP is formed by considering all POS is formed by considering


the minterms, whose output is all the maxterms, whose output
4. HIGH(1) is LOW(0)

5. While writing minterms for SOP, While writing maxterms for


input with value 1 is considered POS, input with value 1 is
as the variable itself and input considered as the complement
S.No
. SOP POS

with value 0 is considered as and input with value 0 is


complement of the input. considered as the variable itself.

--------------------------------

Analysis and Design of Combinational

1. Analysis and Design of Combinational circuits :

To design of combinational circuits, the procedure involves the following steps:


1. Find the required number of inputs and outputs and assign a symbol to each.
2. Derive the truth table according to given specifications and function.
3. Using the truth table, obtain simplified Boolean functions for each output as a
function of the input variables.
4. Draw the logic circuit diagram.
To obtain the output Boolean functions from a logic diagram, the procedure involves
the following steps:
1. Label all gate outputs with unique symbols.
2. Find the Boolean functions for these gates.
To obtain the truth table directly from the logic diagram, the procedure involves the
following steps:
1. Determine the number of input variables in the circuit.
2. Draw the table for these inputs. There are 2^n combinations for the n input
variables (0 to (2^n -1)).
3. Label the outputs with unique symbols for gates in the circuit.
4. Obtain the outputs of these gates in the table.
Drawbacks of Combinational circuits:
If you need to design a system that stores and uses previous input and output, then we
can not use a combinational circuit because it doesn’t have capability to store any
state or depend clock or and time. For these properties you can use Sequential
circuits.

UNIT 1

1 --------------- 1) Which number system has a base 16

a. ANS ; Hexadecimal

2 . In Boolean algebra, the bar sign (-) indicates ………………..


ANS; NOT operation

1. Which of the following is not a positional number system?


a) Roman Number System
b) Octal Number System
c) Binary Number System
d) Hexadecimal Number System
MULTIPLE CHOICE QUESTIONS

1  The binary number 10101 is equivalent to decimal number …………..


1. 19
2. 12
3. 27
4. 21
Answer : 4

2 Boolean Algebra is essentially based on

a. Truth
b. Logic
c. Symbol
d. Numbers

Answer: (b) Logic


3 How many NAND gates are used to form an AND gate?

a. 1
b. 2
c. 3
d. 4

Answer: (b) 2

4 : Which of the following logic gate is a universal gate?

a. OR
b. NOT
c. AND
d. NOR

Answer: (d) NOR

5 . The NOR gate is OR gate followed by ………………


1. AND gate
2. NAND gate
3. NOT gate
4. None of the above
Answer : 3

6 The NAND gate is AND gate followed by …………………


1. NOT gate
2. OR gate
3. AND gate
4. None of the above
Answer : 1

7 . In Boolean algebra, the bar sign (-) indicates ………………..


1. OR operation
2. AND operation
3. NOT operation
4. None of the above
Answer : 3

8  Decimal number 10 is equal to binary number ……………


1. 1110
2. 1010
3. 1001
4. 1000
Answer : 2

9 . A device which converts BCD to seven segments is called ……..


1. Encoder
2. Decoder
3. Multiplexer
4. None of these
Answer : 2

10 . The number of digits in octal system is ………


1. 8
2. 7
3. 9
4. 10
Answer : 1
4) How many entries will be in the truth table of a 4-input NAND gate?

a. 6

b. 8

c. 32

d. 16

5) How many bits are needed to store one BCD digit?

a. 2 bits

b. 4 bits
c. 3 bits

d. 1 bit

9) Which of these sets of logic gates are known as universal gates?

a. XOR, NAND, OR

b. OR, NOT, XOR

c. NOR, NAND, XNOR

d. NOR, NAND

You might also like