NAND and NOR Gates, Adders Flashcards

learnnn all

1
Q

What makes the NAND gate a universal logic gate?

A

The NAND gate is universal because it can create all basic logic functions: NOT, AND, OR, and NOR.

NOT: Connect all inputs together (insert diagram).
AND: Use two NAND gates (insert diagram).
OR: Use three NAND gates (insert diagram).
NOR: Use four NAND gates (insert diagram).

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

What makes the NOR gate a universal logic gate?

A

The NOR gate is universal because it can create all basic logic functions: NOT, OR, AND, and NAND.

NOT: Connect all inputs together (insert diagram).
OR: Use two NOR gates (insert diagram).
AND: Use three NOR gates (insert diagram).
NAND: Use four NOR gates (insert diagram).

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

How do you convert a circuit to use only NOR gates?

A

Replace each gate with its NOR equivalent (insert diagram).
Simplify by removing instances where NOT gates follow each other (insert diagram).
Final simplified circuit (insert diagram).

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

What are the rules for binary addition?

A

0 + 0 = 0
0 + 1 = 1
1 + 0 = 1
1 + 1 = 10 (carry over 1).

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

What is a half adder, and how does it work?

A

A half adder performs binary addition for two 1-bit inputs (A, B).
Outputs:

Sum (Σ): XOR gate (insert truth table and diagram).
Carry (Co): AND gate (insert circuit diagram).

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

What is a full adder, and how is it implemented?

A

A full adder adds three 1-bit inputs (A, B, Cin).

Outputs: Sum (Σ) and Carry (Co).
Implemented with two half adders and an OR gate (insert block diagram and truth table).

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

How does a parallel adder work?

A

A parallel adder performs addition for binary words simultaneously:

Uses a half adder for the least significant bit.
Uses full adders for the remaining bits.
Carry out of one stage connects to the Carry in of the next stage (insert 4-bit adder diagram).

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

Add 1111 and 1111 using a 4-bit parallel adder.

A

Inputs:

A = 1111
B = 1111
Output:

Sum = 11110 (insert circuit diagram for visualization).

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