Reading...
Play button
Play button
Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
28 Cards in this Set
- Front
- Back
|
Computer Architecture
|
Attributes of a system (visible to a programmer).
Have a direct impact on logical execution of a program |
|
|
Computer Organisation
|
The physical parts/operational units and interconnections which realize (in turn creates) architectural specifications
|
|
|
Architectural Attributes
|
- Instruction set
- Bits used to represent data types - I/O mechanisms - Techniques for addressing memory |
|
|
Organisational Attributes
|
- Hardware details (transparent to the programmer)
- Control signals - Interfaces between computer and peripherals - Memory technology used |
|
|
IAS
|
- Finished in 1952
- Uses instructions known as 'words' - 1000 words consisting of 40 bits each - Words consist of left and right instructions |
|
|
Von Neumann Architecture
|
- Single processor architecture
- Uses fetch - decode - execute program - Executed in a linear sequence |
|
|
MBR
|
Memory Buffer Register (aka Memory Data Register)
- Holds data to be written to memory - Holds data from memory to be processed |
|
|
MAR
|
Memory Address Register
- Holds memory address of data to be stored in MBR - Holds address of data to be written to memory from MBR |
|
|
CIR
|
Current Instruction Register
- Contains (8 bit) operand from current instruction |
|
|
IBR
|
Instruction Buffer Register
- Holds right hand instruction of a word in memory |
|
|
PC
|
Program Counter
- Holds address of next instruction |
|
|
AC and MQ
|
Accumulator and Multiplier Quotent
- Holds operands and results of ALU operations |
|
|
Reasons for using hexadecimal
|
More compact than binary - fewer bits
Easy to convert between binary and hex |
|
|
Sign and Magnitude - Con's
|
Addition/subtraction requires consideration of both sign and magnitude
Two representations for zero |
|
|
Overflow Rule
|
If two numbers are added
and they are both positive or both negative, then overflow occurs if and only if the result has the opposite sign |
|
|
Negation Rule
|
To subtract one number from another, take the two's compliment (negation) of of first number and add it to the second
|
|
|
Endian-ness
Big Endian Little Endian |
Big endian - Most significant bit is stored on the left most bit
Little endian - Least significant bit is stored on the left most bit |
|
|
Transistors
|
work like switches
millions (or billions) in cpu/gpu's |
|
|
All logical functions can be replicated using a combination of...
|
and, or, not gates
|
|
|
Two types of MOS transistor
|
N-Type & P-Type
|
|
|
N-Type transistor
|
Positive circuit - switch closed - light on
(NORMAL) |
|
|
P-Type transistor
|
Positive circuit - switch open - light off
(INVERTED) |
|
|
Perceiving voltages
|
voltages on low end are recieved as 0
voltages on high end are recieved as 1 voltages in forbidden region (in between) are ignored |
|
|
CMOS - Complimentary MOS
|
Uses both N-type and P-type transistors
N-type - connected to ground - pulls voltage down when input = 1 P-type - connected to + voltage - pulls voltage up when input = 0 |
|
|
Boolean Algebra
|
Mathmatical discipline used to analyse digital circuitry
|
|
|
De Morgans Law
|
NOT(A AND B) = NOT(A) OR NOT(B)
NOT(A OR B) = NOT(A) AND NOT(B) |
|
|
Eirik Brodaholt
|
IS A ******!
|
|
|
3 Ways of Defining a Combinational Circuit
|
Truth Table
Graphical Equations Boolean Equations |
