recategorized by
4,107 views
21 votes
21 votes

A Boolean function $f$ is to be realized only by $\text{NOR}$ gates. Its $K$-map is given below:

The realization is

  1.  

  2.  

  3.  

  4.  

recategorized by

3 Answers

Best answer
26 votes
26 votes

Two Max Terms are:

$(a+b)(a+c)$ so, $“a"$ is common here only possibility is option D.



K-map will give min terms $= a[4 1's \;\text{circle}] + bc[2 1's\;\text{box}]$

Option D circuit will give  $= (a+b) (a+c) = a+bc$

D will be answer.

edited by
–1 votes
–1 votes
To implement logic function with only NOR, first we need to express it in SOP form.
Answer:

Related questions

18 votes
18 votes
3 answers
1
makhdoom ghaya asked Nov 15, 2016
3,651 views
The below figure shows four $\text{D}$-type flip-flops connected as a shift register using a $\text{XOR}$ gate. The initial state and three subsequent states for three cl...
28 votes
28 votes
3 answers
2
makhdoom ghaya asked Nov 15, 2016
4,175 views
The Boolean expression $A \oplus B \oplus A$ is equivalent to$AB + \overline {A}\;\;\overline B$$\overline{A}\;B+A\;\overline{B}$$B$$\overline{A}$
6 votes
6 votes
1 answer
3
makhdoom ghaya asked Nov 14, 2016
2,392 views
Give a minimal DFA that performs as a $\mod - 3,\;$ $1$'s counter, i.e. outputs a $1$ each time the number of $1$'s in the input sequence is a multiple of $3$.
1 votes
1 votes
0 answers
4
makhdoom ghaya asked Nov 11, 2016
649 views
Design an $8 \times 8$ multiplier using five $4$-bits adders and $4$ ROM's each programmed to realise $4 \times 4$ multiplier.