# Test Series

1 vote
60 views

0
Is it C?
0
Yes please tell in detail
0

We should know that an expression in POS form is always easier to be realized by NOR gates.

Given is the SOP ∑m(0,2,6,10,14) so we should convert it to POS.

Hence piM(1,3,4,5,7,8,9,11,12,13,15) [I couldn't find the "pi" symbol :P]

So the expression is D'.(B'+C).(A'+C)

Now we have to convert this expression in such a way that we can realize it with NOR

( ( D'.(B'+C).(A'+C) )' )' = (  (D')' + (B'+C)' + (A'+C)' )' = (D + BC' + AC' )'

= (D + C'(A+B) )' = (  D + ( ( C'(A+B) )' )'   )' = (D + ( (C')' + (A+B)' )' )'

= (D + ( C + (A+B)' )' )'

X=(A+B)'  --> 1 NOR

Y=(C+ X)'  --> 1 NOR

(D+Y)' --> 1 NOR

2

By k-map, SOP format ===> CD' + A' B' D' ===> D' (C+A'B') ==> D' . ( C + (A+B)' ) ===> ( D + ( C + (A+B)' )'  ) '

TOTAL = 3 NOR GATES

0
Yeah.. Shaik's one is faster.. usually converting to POS works better..but in this case it's not

## Related questions

3 votes
2 answers
1
322 views
Q,R,S are true for sure but how p is true ???
0 votes
1 answer
2
125 views
Consider the following IEEE single precision format A fractional number X is stored as (80700000)16. The decimal equivalent of X is ______.
0 votes
0 answers
3
89 views
Which of the following statements is/are Correct ? A. AND and NOT gate are not necessary but sufficient for realization of any Logic function. B. OR and NOT gate are not necessary but sufficient for realization of any Logic function. C. NOR gates are necessary and sufficient for realization of any logic function. D. Both (a) and (b)
0 votes
1 answer
4
1.5k views
In the circuit shown below, the propagation delay of each NOT gate is 2 nsec, then the time period of generated square wave is - I think it should be 22ns but it is given 20ns Suppose at time 0 the output at last FF ( right most FF) is 0 Then at time 12 nsec output will change ... at last FF will change from 1 to 0 at 22nsec. So, the output changes 0 -> 1 -> 0 in 22nsec. Where I am doing wrong.