Minimize the following Boolean expression using K-map

1.0kviews

written 6.6 years ago by

teamques10 ★ 69k

• modified 4.4 years ago

F(A,B,C,D) = ∑m(0,3,7,11,15) + d(1,2,5)

digital logic design

ADD COMMENT EDIT

1 Answer

4views

written 6.6 years ago by

teamques10 ★ 69k

• modified 6.6 years ago

$f(A, B, C, D) = \sum m(0, 3, 7, 11, 15) + d(1, 2, 5)$ Simplification using K-map is as shown under ![1][1] $So,$ $F(A, B, C, D) = \overline{A}\hspace{0.1cm}\overline{B}+CD$

Create a free account to keep reading this post.

and 4 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.