Ask
Login
0
862views
Minimize the following Boolean expression using K-map
written 5.6 years ago by gravatar for teamques10 teamques10 ★ 64k •   modified 3.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
0
4views
written 5.6 years ago by gravatar for teamques10 teamques10 ★ 64k •   modified 5.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$
ADD COMMENT EDIT
Please log in to add an answer.