Question

Problem 5: Simplify the following Boolean functions, using K-maps:

A. ?(?, ?, ?) = ∑(0,1,2,3,5) B. ?(?, ?, ?, ?) = ∏(1,3,6,9,11,12,14)

Problem 6: Simplify the following Boolean function F, together with the don’t-care conditions

A. ?(?, ?, ?) = ∑(0,1,4,5,6), ?(?, ?, ?) = ∑(2,3,7)

B. ?(?,?, ?,?) = ∑(0,6,8,13,14), ?(?,?, ?,?) = ∑(2,4,10)

Answer 1

The question is solved in the pictures attached.

The key target here is to make the maximum group as much as possible in the powers of 2. That is 1,2,4,8,16.

For Don't care cross is put.

I hope this helps you. If you have any doubts ask me in the comment section. Thankyou.