recategorized by
2,546 views
17 votes
17 votes

Three switching functions $f_1, \: f_2 \:$ and $f_3$ are expressed below as sum of minterms.

  • $f_1 (w, x, y, z) = \sum \: 0, 1, 2, 3, 5, 12$
  • $f_2 (w, x, y, z) = \sum \: 0, 1, 2, 10, 13, 14, 15$
  • $f_3 (w, x, y, z) = \sum \: 2, 4, 5, 8$

Express the function $f$ realised by the circuit shown in the below figure as the sum of minterms (in decimal notation).

recategorized by

1 Answer

Best answer
19 votes
19 votes

Final output $= \sum  0,1,2,4,5,8$

  • $f_1(w,x,y,z) = \sum 0,1,2,3,5,12$
  • $f_2(w,x,y,z) = \sum 0,1,2,10,13,14,15$
  • $f_3(w,x,y,z) = \sum 2,4,5,8$

$f1\text{ AND }f_2$ will give the common minterms - $f_{12} =\sum 0,1,2.$

Now $f_{12} \text{ OR } f_3 = \sum 0,1,2,4,5,8.$

edited by

Related questions

8 votes
8 votes
1 answer
1
14 votes
14 votes
1 answer
2
go_editor asked Dec 11, 2016
2,226 views
Define the value of $r$ in the following: $\sqrt {(41)_{r}} = (7)_{10}$
20 votes
20 votes
1 answer
3
go_editor asked Dec 11, 2016
1,929 views
Let $*$ be defined as a Boolean operation given as $x*y = \overline{x}\;\;\overline{y}+xy$ and let $C=A*B$. If $C=1$ then prove that $A=B$.
7 votes
7 votes
2 answers
4
go_editor asked Dec 19, 2016
2,955 views
Using binary full adders and other logic gates (if necessary), design an adder for adding $4$-bit number (including sign) in $2’s$ complement notation.