Gate Architecture Flashcards

1
Q

Gates

A

Device constructed from transistors that perform simple Boolean operations

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

Circuits

A

Device constructed from multiple gate that use the outputs of these gates to construct a Boolean expression

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

Exclusive or (XOR)

A

Either but not the same (x=/=y)

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

NAND Gate

A

NOT of the AND gate, both zero or Either.

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

NOR Gate

A

None only, else everything zero.

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

Transistors

A

Small devices constructed using semi-conducting materials, more efficient then the vacuum tube and has three components.

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

Transistor Source

A

Produces a voltage within the transistor, usually linked to computer power

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

Transistor Emitter

A

Connected to a ground wire, takes the output of the transistor

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

Transistor Base

A

Logic center of the Transistor

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

Associative Boolean Law

A
AB(C) = AB(C)
A+(B+C) = (A+B)+C
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Commutative Boolean Law

A
AB = BA
A+B = B+A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Distributive Boolean Law

A

A(B+C) + AB+AC

A+(BC)=(A+B)(A+C)

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

Identity and Complement Boolean Laws

A

Identity - returns the original expression, A+0 or Ax1

Complement - AxA’ = 0, A+A’ = 1

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

De Morgans

A
(AB)' = A' + B' 
(A+B)' = A'B'
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Three methods of expressing logic within computer systems

A

Boolean Equations, Logic Diagrams, Truth Tables

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

Half and Full Adders

A

Adders are simple circuits used to perform binary addition. Half adders don’t take carry ins into account, whilst full adders do.

17
Q

Multiplexer (MUX)

A

Circuit that uses multiple inputs to determine which information is routed to the output - information is predetermined, only which one gets routed isn’t determined.

18
Q

Sequential Circuits

A

Circuits that are dependent on internal state of the system - volatile memory for example

19
Q

S-R Memory

A

Circuit able to store a single binary bit - several ways to be constructed, but simplest method is using two NAND gates

Design of the circuit typically result in N outputs never being the same, and a single output being considered as the information stored.

19
Q

S-R Memory

A

Circuit able to store a single binary bit - several ways to be constructed, but simplest method is using two NAND gates

Design of the circuit typically result in N outputs never being the same, and a single output being considered as the information stored.

20
Q

Integrated Circuits

A

Also known as a chip, piece of silicon with multiple gates etched into the board, usually mounted on a plastic/ceramic package and pins are soldered or socketed into appropriate I/O slots.