Transcript 3aclass15 - davidspellman

Monday, December 6
Assignment(s) due:
Assignments #11(original or redo), #12 and #EC2 are due tonight
Tonight is the last chance to turn in Quizzes #13 and #14 (extra credit)
- this semester we have looked at the ideas behind “C = A + B”
- how A, B and C would be stored
- as whole numbers and floating point numbers
-positive and negative
- how the addition function can be derived from a truth table
- and simplified
- the half adder and full adder circuits that would do the addition
- and the gates that make up the circuits
- and how transistors make the gates work
- how the memory circuits that store the numbers work
- how the numbers would be processed through the data path of the computer
- and at some of the microinstructions that would make it happen
- using the Simple Computer
Computer architecture:
- if we use an application
- it has likely been written in a high level language
- and compiled to assembly language
- each high level language statement probably became several assembly language statements
- then it was assembled to machine language
- each machine code instruction is interpreted by microinstructions
- signals to the control lines
- that fetch the instruction and execute it
- all instructions and data move through the data path of the computer
- each control signal was the input to a circuit
- each sequential circuit (memory, register) is a sequence of flip-flops
- cross-connected gate circuits
- each combinational circuit is made up of only a few different gates
- and each gate follows the rules of Boolean algebra
The datapath of the
ARC computer:
(Murdocca)
The datapath of the
ARC computer:
(Murdocca)
The final is Monday, December 13 from 5:15 p.m. to 7:15 p.m.
- one 8.5x11 cheat sheet (both sides)
- I will provide a list of Boolean theorems and a data path diagram
(- if you will be late because of work commitments, let me know)
- no computers
- no calculators
- no ipods
- no pdas
- no cell phones
- no consultation
- etc.
You will need a scantron for part of the test
Given the following truth table, which Karnaugh map below is correct?
0%
0%
0%
0%
a)
b)
c)
1.
2.
3.
4.
a
b
c
d
d)
1
2
3
4
Given the following K-map, how many terms will there be in the simplified result?
0%
1.
2.
3.
4.
0%
0%
0%
One
Two
Three
Four
1
2
3
4
Given the following K-map, are there two possible correct solutions?
0%
1.
2.
0%
True
False
1
2
Given the following K-map, the third term may be:
0%
1.
2.
3.
4.
0%
0%
2
3
0%
A'C or A'B
AB' or A'C
A'B or B'C
A'C or B'C
1
4
Given the expression XY'Z + YZ + XZ', how many ones would there be in the K-map?
0%
1.
2.
3.
4.
0%
0%
0%
Three
Four
Five
Six
1
2
3
4
If X = 1, Y = 0 and Z = 1 what is the output from the following circuit:
0%
1.
2.
0%
0
1
1
2
If the state of the clocked latch below is 0 (Q = 0, Q' = 1) and D = 1, what is the state of the latch after a
clock pulse?
0%
1.
2.
0%
0
1
1
2
In the Simple Computer, how many clock cycles does it take to complete one data path cycle?
0%
1.
2.
3.
4.
0%
0%
2
3
0%
One
Two
Three
Four
1
4
Data from the Simple Computer shifter may go to:
0%
1.
2.
3.
4.
0%
0%
0%
The C bus
The RMUX
The MBR
All of the above
1
2
3
4
A line is ? when it is activated.
0%
1.
2.
3.
4.
0%
0%
2
3
0%
Asserted
Negated
Live
None of the above
1
4
A Karnaugh map is a ? representation of a Boolean expression.
0%
1.
2.
3.
4.
0%
0%
0%
Boolean
Venn
Picture
Graphical
1
2
3
4
A Boolean function returns one of how many possible values?
0%
1.
2.
3.
4.
0%
0%
0%
One
Two
Three
Four
1
2
3
4
A Medium-Scale Integration (MSI) chip usually has at least how many gates?
0%
1.
2.
3.
4.
0%
0%
0%
Ten
Thirty
One hundred
One thousand
1
2
3
4
A ? outputs the value of one of its input lines?
0%
1.
2.
3.
4.
0%
0%
0%
Decoder
Comparator
Multiplexer
None of the above
1
2
3
4
In a truth table, input combinations that will never happen are called:
0%
1.
2.
3.
4.
0%
0%
2
3
0%
Never happen conditions
Don't care conditions
Invalid conditions
Extra conditions
1
4
Add a parity bit to the 7-bit ASCII code for 'K' using even parity. (the ASCII code for 'K' is 75 10).
The resulting byte:
0%
1.
2.
3.
4.
0%
0%
2
3
0%
10010110
10010111
01001011
11001011
1
4
The Hamming codeword for the 7-bit character 'K' using odd parity:
0%
1.
2.
3.
4.
0%
0%
2
3
0%
00100011011
01100011011
01100010011
01110011011
1
4
A flip-flop is a(n) ? -triggered device:
0%
1.
2.
3.
4.
0%
0%
2
3
0%
latch
edge
level
input
1
4
The basic storage circuit is:
0%
1.
2.
3.
4.
0%
0%
2
3
0%
a transistor
a latch
a gate
a flip-flop
1
4
The address of data being read from memory is stored in:
0%
1.
2.
3.
4.
0%
0%
2
3
0%
the ALU
the MBR
the RMux
the MAR
1
4
The control line to ? is controlled only by the clock:
0%
1.
2.
3.
4.
0%
0%
2
3
0%
the A-latch
the ALU
the MBR
the AMux
1
4
Review topics:
Multiple choice questions:
- identify terms
- from class lectures, slides, the Simple Computer Chapter 3
- express a gate diagram as a Boolean expression
- simplify a Boolean expression through Karnaugh maps
- follow the path of a given function through a given circuit
Fill-in questions:
- prove an equation using a truth table
- simplify a Boolean expression using Boolean theorems
- given a Boolean expressions, draw the circuit diagram
- given a truth table
- derive the Boolean expression from the truth table
- simplify the Boolean expression using a Karnaugh map
- simplify the Boolean expression using Boolean algebra
- draw a gate diagram of the simplified function
- given a flip-flop diagram, indicate the output
Monday, December 6
Assignment(s) due:
Assignments #11(original or redo), #12 and #EC2 are due tonight
Tonight is the last chance to turn in Quizzes #13 and #14 (extra credit)
The final is next Monday from 5:15 p.m. to 7:15 p.m.
You are allowed a cheat sheet (8.5" x 11"), but no electronic or human helpers