recategorized by
1,416 views
4 votes
4 votes

____ number of gates are required to implement the Boolean function $(AB+C)$ with using only $2$-input NOR gates.

  1. $2$
  2. $3$
  3. $4$
  4. $5$
recategorized by

2 Answers

2 votes
2 votes
NOR is Complement of OR
AB+C
= (A+C)(B+C) ← Distribution of + over
= ((A+C)’+(B+C)’)’
1st NOR- (A+C)’. Let X = (A+C)’
2nd NOR- (B+C)’. Let Y = (B+C)’
3rd NOR- (X+Y)’
Answer:

Related questions

2 votes
2 votes
2 answers
1
Arjun asked Dec 7, 2018
863 views
$(A+C’)(B’+C’)$ simplifies to$AC’+B’$$C(A’+B’)$$BC’+A$$AB’+C’$
4 votes
4 votes
2 answers
2
Arjun asked Dec 7, 2018
1,383 views
In the given truth table, $f(x,y)$ represent the Boolean function.$$\begin{array}{|c|c|c|} \hline x & y & f(x,y) \\ \hline 0 & 0 & 1 \\ \hline 0 & 1 & 0 \\ \hline 1 & 0 &...
1 votes
1 votes
3 answers
3
Arjun asked Dec 7, 2018
2,670 views
A RAM chip has a capacity of $1024$ words of $8$ bits each $(1K \times 8)$. The number of $2 \times 4$ decoders with enable line needed to construct a $32 K \times 8$ RAM...
1 votes
1 votes
1 answer
4
Arjun asked Dec 7, 2018
1,430 views
The hexadecimal representation of $(632)_8$ is$19A$$198$$29A$$291$