MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Skew Symmetric Matrix

Find the mini...

Question

Find the minimum number of NAND gates required to implement $A + A ¯ B + A ¯ B C$ .

Open in App

Solution

Let us simplify the given logic.
$A + A ¯ B + A ¯ B C = A (1 + ¯ B + ¯ B C) = A$
So, no NAND gates are required to implement $A + A ¯ B + A ¯ B C$ .

Suggest Corrections

thumbs-up

3

Similar questions

Q. Minimum number of 2-input NAND gates required to implement the Boolean function given below is _______.

f = (¯ ¯¯ ¯ A + ¯ ¯¯ ¯ B) (C + D)

Q. The total number of NAND gates required to implement a

4 \times 1

multiplexer is (assuming a NAND gates of any number of inputs are available) ____

Q. Consider a Boolean expression.

f = (B + B C) (B + ¯ ¯¯ ¯ B C) (B + D)

The minimum number of NAND-gates required to implement this function

^{'} f^{'}

will be __________

Q. The minimum number of NOR gates required to implement an Ex-OR gate is ____

Q. If the complements of inputs are available, minimum number of 2 input NAND gates required to realize the mentioned below function will be _______

F (A, B, C, D) = B ¯ ¯¯¯ ¯ D + ¯ ¯¯ ¯ B C D + A B C + A B ¯ ¯¯ ¯ C D + ¯ ¯¯ ¯ B ¯ ¯¯¯ ¯ D

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Symmetric Matrix

MATHEMATICS

Watch in App

explore_more_icon

Explore more

Skew Symmetric Matrix

Standard XII Mathematics

Join BYJU'S Learning Program

CrossIcon