Study Guide #3 Flashcards

1
Q

Microoperation

A

Fundamental operation on data stored in registers that can be performed in one clock pulse

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

What are the four categories of microoperations?

A
  • Data transfer
  • Arithmetic
  • Logical
  • Shift
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What does the following mean in data transfer notation: C: R2 <— R1

A

Load from Register 1 into Register 2

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

How to build an n-bit. one directional data bus using multiplexers

A

registers into MUX and out to another register

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

Know the rules for number and size of multiplexers

A
  1. Sign of MUX is determined by the # of registers
  2. # of MUX is determined by # of bits per register
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is the tri-state output

A

three outputs: 0 , 1 , high-impedence (Z)

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

How to build an n-bit one directional data bus using tri-state buffers

A

2x4 decoder, each output into data line A-D with inverters sticking out. All then connect back to A line

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

Memory read as a microoperation

A

R <– M [Ad]

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

How to build a simple 4-bit adder circuit (figure 4-6)

A

full adders connected through carry in/outs

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

How to build a simple 4-bit adder-subtractor (figure 4.7)

A

full adders from right to left connected through carry in/outs. A input normal but B input is B and M passed in XOR gate.

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

What property of an exclusive-OR gate did we discuss that allows for either addition or subtraction in figure 4-7

A

if m = 0, B gets through
if m = 1 , B’ gets through

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

Be able to add or subract two binary numbers

A

subtract: 2s complement

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

take the two’s complement of a binary number

A

inverse and add 1

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

Know how to build a Logic unit that performs several logical operations (figure 4-10)

A

4x1 MUX with each operation function in each input. Ex 0 = AND 1 = OR, etc.

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

Selective-set

A

if control = 1, A = 1

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

Selective-complement

A

If control = 1, A = A’

17
Q

Selective-clear

A

If control = 1, A = 0

18
Q

Mask

A

If control = 1, A stays same, otherwise A = 0

19
Q

Logical Shift microoperations

A

transfer 0 into serial in

20
Q

Circular shift microoperations

A

circulate bits of register around two ends without loss of information

21
Q

What was the goal in Lab 6?

A

to add two 2-bit numbers together

22
Q

What chip did we use in Lab 6?

A

7483 4-bit adder chip

23
Q

What did we have to do with the carry-input to the 4-bit adder in Lab 6?

A

set it to 1

24
Q

How many bits do we add together in Lab 6?

A

2 bit originally, 4 bit extra credit

25
What was the extra credit part in lab 6?
4 bit adder and connect to display
26
What was the purpose of lab 7?
create a circuit to add two registers
27
What chips did we use in lab 7?
4 bit adder, register, mux
28
If sum is one more than expected, what might be wrong? in lab 7
carry input is messed up
29
what are s1, s0, cin in the 4-bit arithmetic circuit to carry out addition
0 0 0
30
what are s1, s0, cin in the 4-bit arithmetic circuit to carry out subtraction
0 1 1
31
what are s1, s0, cin in the 4-bit arithmetic circuit to carry out increment
1 0 1
32
what are s1, s0, cin in the 4-bit arithmetic circuit to carry out decrement
1 1 0
33
what are s1, s0, cin in the 4-bit arithmetic circuit to carry out pass through
1 1 1
34
arithmetic left shift
- multiplies signed # by 2. Insert 0 into rightmost bit. OVERFLOW
35
arithmetic right shift
- divides signed # by 2. Sign bit stays same. NO OVERFLOW