# GATE1989-4-iii

535 views
Provide short answers to the following questions:

Show that {NOR} is a functionally complete set of Boolean operations.

Functionally complete set is by which you can perform all operations. So, if any logical set is able to implement the operation {And ., NOT}  or {OR, NOT} ; it is known as functionally complete .

Now come to NOR gate .

A(NOR)B= (A+B)'

A(NOR)A =(A+A)' =(A)'  , so we can perform the NOT operation .

(A+B)' NOR (A+B)' =((A+B)' + (A+B)')' =((A+B)')' =(A+B) , so OR operation is also performed successfully .

So, NOR is the functionally complete .

edited
0
0
Yes, This is the definition for functionally completeness.
0
Theorem: A System of boolean functions is functionally complete iff this system doesn't entirely belong any of property listed:

1. F preserve 0.

2. F preserve 1

3. F is linear

4. F is monotone

5. F is self dual

For this question: 1. F doesn't preserve 0 i.e for i/p 0 it produces 1 similarly it doesn't preserve 1. F is not linear there is even and odd no. of 1's when o/p is 0. F is not monotone i.e for 00 it is 1 then it goes from 1 to 0. F is not self dual i.e  $\neg(A+B)$ != $\neg(A)+ \neg(B)$.  $\therefore$ F is Functionally complete.
1 vote

WE Know that we can derive any GAte from NAND,NOR, so all boolean functions can be derived from NOR

so it is functionally complete

http://www.electrical4u.com/universal-gate-nand-nor-gate-as-universal-gate/

Preserves Zero : $\times$ Preserves One : $\times$ Linear : $\times$

Monotone : $\times$ Self-Dual : $\times$

NOR is functionally Complete.

## Related questions

1 vote
1
406 views
Provide short answers to the following questions: A switching function is said to be neutral if the number of input combinations for which its value is 1 is equal to the number of input combinations for which its value is 0. Compute the number of neutral switching functions of $n$ variables (for a given n).
Find values of Boolean variables $A, B, C$ which satisfy the following equations: A+ B = 1 AC = BC A + C = 1 AB = 0
Consider an excess - 50 representation for floating point numbers with $4 BCD$ digit mantissa and $2 BCD$ digit exponent in normalised form. The minimum and maximum positive numbers that can be represented are __________ and _____________ respectively.