Logic function and minimization Flashcards

1
Q

NAND GATE function

A

(a.b)’

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is functionally complete connective?

A

If all boolean functions can be synthesised using it.
ex. NAND, NOR

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

NOR gate function

A

(a+b)’

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is self dual function

A

A function is self dual if it is equal to its dual (A dual function is obtained by interchanging + and . )

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

The boolean function : x’y’ + xy + x’y is equivalent to

A

x’+y

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

The maximum number of different boolean functions involving in ‘n’ boolean variables?

A

(2^(2^n))

How well did you know this?
1
Not at all
2
3
4
5
Perfectly