Electronics and Communication Engineering (ECE) Exam  >  Electronics and Communication Engineering (ECE) Tests  >  Test: SOP Form - Electronics and Communication Engineering (ECE) MCQ

Test: SOP Form - Electronics and Communication Engineering (ECE) MCQ


Test Description

9 Questions MCQ Test - Test: SOP Form

Test: SOP Form for Electronics and Communication Engineering (ECE) 2024 is part of Electronics and Communication Engineering (ECE) preparation. The Test: SOP Form questions and answers have been prepared according to the Electronics and Communication Engineering (ECE) exam syllabus.The Test: SOP Form MCQs are made for Electronics and Communication Engineering (ECE) 2024 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Test: SOP Form below.
Solutions of Test: SOP Form questions in English are available as part of our course for Electronics and Communication Engineering (ECE) & Test: SOP Form solutions in Hindi for Electronics and Communication Engineering (ECE) course. Download more important topics, notes, lectures and mock test series for Electronics and Communication Engineering (ECE) Exam by signing up for free. Attempt Test: SOP Form | 9 questions in 30 minutes | Mock test for Electronics and Communication Engineering (ECE) preparation | Free important questions MCQ to study for Electronics and Communication Engineering (ECE) Exam | Download free PDF with solutions
Test: SOP Form - Question 1

Which operation is used in expression AB + BC + AC?

Detailed Solution for Test: SOP Form - Question 1

Canonical Form:  
Any Boolean function that expressed as a sum of min terms or as a product of max terms is said to be in its canonical form.
There are two types of canonical forms:
SOP:
Sum of products or sum of min terms
Example of SOP: XY + X’Y’
POS:
Product of sums or product of max terms
Example of POS: (X+Y) (X’+Y’)
Explanation:
SOP contains only sum of min terms hence option 1 is the correct answer.

Test: SOP Form - Question 2

Which of the following is a 'Sum of product' form?

Detailed Solution for Test: SOP Form - Question 2

Canonical Form:  Any Boolean function that is expressed as a sum of min terms or as a product of max terms is said to be in its canonical form.
There are two types of canonical forms:
SOP:

  • Sum of products or sum of min terms

Example of SOP: XY + X’Y’
POS:

  • Product of sums or product of max terms

Example of POS: (X+Y) (X’+Y’)

1 Crore+ students have signed up on EduRev. Have you? Download the App
Test: SOP Form - Question 3

In the following circuit determine the output F as sum of minterms

Detailed Solution for Test: SOP Form - Question 3

Canonical form:  Any Boolean function that expressed as a sum of minterms or as a product of max terms is said to be in its canonical form.
There are two types of canonical forms:
SOP:
Sum of products or sum of minterms
In SOP (sum of product) form, a minterm is represented by 1.
Example of SOP: XY + X’Y’
POS:
Product of sums or product of max terms
In POS (product of sum) form, a maxterm is represented by 0.
Example of POS: (X+Y) (X’+Y’)
Calculation:


F(A, B, C) = ∑ (2, 4, 5, 7)

Test: SOP Form - Question 4

Which of the following expressions is in the Sum­-Of­-Products (SOP) form?

Detailed Solution for Test: SOP Form - Question 4

Sum of Product:
SOP is an abbreviation for Sum of Product. Sum of product form is a Boolean algebra statement in which distinct product terms of inputs are added together. This product is not an arithmetic multiply, but rather a Boolean logical AND, with the Sum being a Boolean logical OR.
SOP gives a minterm of a logical expression. 
Example:
F= XY+YZ+ XZ
The above expression can be written like,
F= X.Y+Y.Z+ X.Z
F= (X) and (Y) or (Y) and (Z) or (X) and (Z)
In minterms X takes as '1' and X' takes 0 similarly same conventions follow for all variables.
XY= 110 (m6) and 111 (m7)
YZ= 011 (m3) and 111 (m7)
ZX= 101 (m5) and 111 (m7)
Min terms are, F= Σ(3,5,6,7)
Product of sum:
POS is an abbreviation for Product of Sum. Product of sum form is a Boolean algebra statement in which distinct product terms of inputs are multiplied together. This Sum is a Boolean logical OR, with the product being a Boolean logical AND.
POS gives a maxterm of a logical expression. 
Example:
F= (X+Y). (Y+Z). (X+Z)
The above expression can be written like,
F= X+Y). (Y+Z). (X+Z)
F= (X) or (Y) and (Y) or (Z) and (X) or (Z)
In max terms X takes as '0' and X' takes '1' similarly same conventions follow for all variables.
X+Y= 000 (M0), 001 (M1)
Y+Z=000 (M0), 100 (M4)
Z+X=000 (M0), 010 (M2)
Max terms are, F= Σ(0, 1, 2,4)
Option 1:(A + B)(C + D)
False
, It is in product of sum.
Option 2:(A)-­B (CD) 
False,
 It is not in POS and SOP.
Option 3: AB (CD)
False
, It is not in POS and SOP.
Option 4: AB + CD
True
, It is a correct form Sum of Product. It is Boolean logical AND, with the Sum being a Boolean logical OR.
Hence the correct answer is AB+CD.

Test: SOP Form - Question 5

The minterm expansion of f (P, Q, R) = PQ + QR̅ + PR̅ is

Detailed Solution for Test: SOP Form - Question 5

F(P, Q, R) = PQ + QR' + PR'
= PQ (R + R') + (P + P')QR' + P(Q + Q')R'
= PQR + PQR' + PQR' + P'QR' + PQR' + PQ'R'
= PQR + PQR' + P'QR' + PQ'R'
= m7 + m6 + m2 + m4
= m2 + m4 + m6 + m7

Test: SOP Form - Question 6

The simplified SOP (Sum of Product) form of the Boolean expression (P + Q̅ + R̅)⋅(P + Q̅ + R)⋅(P + Q + R̅) is

Detailed Solution for Test: SOP Form - Question 6

Some laws of Boolean Algebra:
Distributive Law:

  • P +QR = (P + Q).(P + R)
  • P(Q + R) = PQ + PR

Inverse Law:

  • PP̅ =0 
  • P + P̅ =1

F = (P + Q̅ + R̅)⋅(P + Q̅ + R)⋅(P + Q + R̅)
F= ((P + Q̅) + R̅.R)(P + Q + R̅)
F = (P + Q̅)(P + Q + R̅)
F = P + Q̅.(Q + R̅)
F = P + Q̅R̅

Test: SOP Form - Question 7

The Boolean SOP expression obtained from the truth table is:

Detailed Solution for Test: SOP Form - Question 7

We can minimize the Boolean expression/truth table of ‘n’ variable using a K-map in which 2n cells are present.
Steps to solve expression using K-map:

  • Select the K-map according to the number of variables (Cells = 2n)
  • Identify maxterm or minterm as given as per the problem.
  • For SOP, put 1’s in blocks of K-map respective to the minterms.
  • For POS, put 0’s in blocks of K-map respective to the max terms.
  • To minimize, make rectangular groups containing total terms in power of two (like 1, 2, 4, 8..).
  • From the groups made in step-5, find the product terms & add them for SOP form.

Calculation:
The truth table given is:

The 3 – variable K-map corresponding to the given truth table is drawn with 23 = 8 (cells) as shown:

By making a group of 1’s,
Output (X) = A̅ B̅ C + A B C̅ 

Test: SOP Form - Question 8

For the figure given, the output will be

Detailed Solution for Test: SOP Form - Question 8

Test: SOP Form - Question 9

Which one of the following gives the simplified sum of products expression for the Boolean function F = m0 + m2 + m3 + m5, where m0, m2, m3 and m5 are minterms corresponding to the inputs A, B and C and A as the MSB and C as the LSB?

Detailed Solution for Test: SOP Form - Question 9

F = ∑m (0, 2, 3, 5)

Information about Test: SOP Form Page
In this test you can find the Exam questions for Test: SOP Form solved & explained in the simplest way possible. Besides giving Questions and answers for Test: SOP Form, EduRev gives you an ample number of Online tests for practice

Top Courses for Electronics and Communication Engineering (ECE)

Download as PDF

Top Courses for Electronics and Communication Engineering (ECE)