मराठी

Write POS Boolean expressions for F (a, b) = ab'+a'b. Show through Boolean algebra reduction that the SOP and POS expressions are indeed equivalent to one another.

Advertisements
Advertisements

प्रश्न

Write POS Boolean expressions for F (a, b) = ab'+a'b. Show through Boolean algebra reduction that the SOP & POS expressions are indeed equivalent to one another.

दीर्घउत्तर
Advertisements

उत्तर

Given:

F(a,b) = ab′ + a′b

This is the SOP form.

To write the POS form, use the rows where F = 0.

For ab′ + a′b, the output is 0 when:

(a, b) = (0, 0), (1, 1)

So the POS form is:

F = (a + b)(a′ + b′)

Now prove both are equivalent.

(a + b)(a′ + b′) ​= aa′ + ab′ + ba′ + bb′

= 0 + ab′ + a′b + 0

= ab′ + a′b​

Therefore,

(a + b)(a′ + b′) = ab′ + a′b

shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 12: Boolean Functions and Reduce Forms - EXERCISE [पृष्ठ २३७]

APPEARS IN

सीबीएसई Computer Science with Python [English] Class 12
पाठ 12 Boolean Functions and Reduce Forms
EXERCISE | Q 18. | पृष्ठ २३७
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×