English

Reduce the following Boolean expression using k-map. F(w,x,y,z) = (w + x) ( x + z') (w' + y' + z) to SOP form

Advertisements
Advertisements

Question

Reduce the following Boolean expression using k-map.

F(w,x,y,z) = (w + x) ( x + z') (w' + y' + z) to SOP form

Short Answer
Advertisements

Solution

F(w,x,y,z) = (w + x)(x + z′)(w′ + y′ + z)

After plotting the corresponding values in the 4-variable K-map and making the largest possible groups, we get:

F = xz + xw′ + wy′z′

Hence, the minimized SOP form is:

F = w′x + xz + wy′z′

shaalaa.com
  Is there an error in this question or solution?
Chapter 12: Boolean Functions and Reduce Forms - EXERCISE [Page 237]

APPEARS IN

CBSE Computer Science with Python [English] Class 12
Chapter 12 Boolean Functions and Reduce Forms
EXERCISE | Q 20. ii) | Page 237
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×