Chapter 4 Gates & Circuits Flashcards

You may prefer our related Brainscape-certified flashcards:
1
Q

Gate

A

A device that performs a basic operation on electrical signals, accepting one or more input signals and producing a single output signal

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

Circuit

A

A combination of interacting gates designed to accomplish a specific logical function

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

Boolean algebra

A

A math-ematical notation for expressing two- valued logical functions

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

Logic diagram

A

A graphical representation of a circuit; each type of gate has its own symbol

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

Truth table

A

A table showing all possible input values and the associated output values

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

NOT Gate

A

inverts its single input value.

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

Symbol for a NOT gate

A

a triangle with a small circle ( called an inversion bubble) on the end.

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

AND Gate

A

produces 1 if both input values are 1.

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

In Boolean expressions, the NOT operation is represented by the ‘ mark after the value being negated. Sometimes this operation is shown as a horizontal bar over the value being negated.

For example, the result of the Boolean expression 0 is always 1, and the result of the Boolean expression 1 is always 0.

A

In Boolean expressions, the ______ operation is represented by the ‘ mark after the value being negated. Sometimes this operation is shown as a horizontal bar over the value being negated.

For example, the result of the Boolean expression 0 is always 1, and the result of the Boolean expression 1 is always 0.

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

The AND operation in Boolean algebra is expressed using a single dot (.). Sometimes an asterisk (*) is used to represent this operator. Often the operator itself is assumed. For example, A. B is often written AB.

A

The ____ operation in Boolean algebra is expressed using a single dot (.). Sometimes an asterisk (*) is used to represent this operator. Often the operator itself is assumed. For example, A. B is often written AB.

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

Four situations can occur when the AND operator is used in a Boolean expression:

0 . 0 equals 0

0 . 1 equals 0

1 . 0 equals 0

1 . 1 equals 1

A

Four situations can occur when the AND operator is used in a Boolean expression:

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

OR Gate

A

produces 1 if one or the other or both input values are 1.

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

An XOR gate

A

produces 1 if one or the other ( but not both) input values are 1.

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

A NAND gate

A

produces the opposite results of an AND gate.

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

A NOR gate

A

produces the opposite results of an OR gate.

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