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;
36 Cards in this Set
- Front
- Back
- 3rd side (hint)
How Many bits in a Byte? |
8 |
An internet speed of 24 mb is only 3 mB. Careful when choosing internet provider. |
|
Size of Char? |
1 Byte |
|
|
ILP |
Instruction-level parallelism (ILP) is a measure of how many of the operations in a computer program can be performed simultaneously. The potential overlap among instructions is called instruction level parallelism. |
|
|
CPI |
Clocks Per Instruction ( or Cycles PI) |
|
|
ALU vs. FPU |
an arithmetic logic unit (ALU) is a digital circuit that performs arithmetic and bitwise logical operations on integer binary numbers. It is a fundamental building block of the (CPU) This is in contrast to a floating-point unit (FPU), which is a digital circuit that operates on floating point numbers with the aid of one or more internal ALUs. |
|
|
PE |
Processing Element (e.g. FPU, ALU, etc.) |
|
|
ISA |
An instruction set, or instruction set architecture (ISA), is the part of the computer architecture related to programming, including the native data types, instructions, registers, addressing modes, memory architecture, interrupt and exception handling, and external I/O. |
|
|
CISC v.s RISC |
Complex instruction set computing (CISC) is a CPU design where single instructions can execute several low-level operations (such as a load from memory, an arithmetic operation, and a memory store) or are capable of multi-step operations or addressing modes within single instructions. RISC (reduced instruction set computing) is designed to perform a smaller number of types of computer instructions so that it can operate at a higher speed. Since each instruction type that a computer must perform requires more transistors -> complicated -> slow computer. |
|
|
VLIW |
Very long instruction word (VLIW) describes a computer processing architecture in which a language compiler or pre-processor breaks program instruction down into basic operations that can be performed by the processor in parallel. These operations are put into a very long instruction word which the processor can then take apart without further analysis, handing each operation to an appropriate functional unit. |
|
|
CMP |
A Chip Multiprocessor is a multi-core processor. |
|
|
multi-issue |
Ability to perform more than 1 instruction at once. |
|
|
Draw Computer Organization Chart |
http://deploy.virtual-labs.ac.in/labs/cse10/images/comp5.png |
|
|
Memory Hierarchy ( visually from top to bottom) |
Disk. Main memory last cache ... Cache2 Cache1 Registers |
|
|
Process |
thread of execution wt its own state, including entire virtual memory. |
|
|
state |
all the stored information, at a given instant in time, to which the circuit or program has access. |
|
|
thread |
a thread of execution with its own stack & regs but possibly hares much of its state with other threads. |
|
|
Virtual Memory |
Illusion given to program that it has entire memory address space to itself |
|
|
Stack Starts... |
Typically stack starts at high and grows downward |
|
|
Heap Starts.... |
Typically heap starts at low and grows upward. |
|
|
sizeof(int), sizeof(float) |
32 bits |
|
|
sizeof(long) |
32 or 64 bits. Depends on if compiled for 32 or 64. |
|
|
sizeof(long long), sizeof(double) |
64 bits |
|
|
sizeof(char) |
1 Byte |
|
|
automatic variables |
Declared in scope, accessible only in scope, stop existing when scope execution finishes. |
|
|
sizeof(short) |
16 bits |
|
|
private global variables |
like public global variables, but may be declared inside functions with static modifier.
if declared in scope, private to scope. if declared outside scope, private to the file. |
|
|
Unsigned int |
Unsigned can hold a larger positive value, and no negative value. Leftmost bit is normal. |
|
|
Signed int |
signed integers can hold both positive and negative numbers. You can assume this is 2's complement, which means leftmost bit is 1 for negative, 0 for positive. |
|
|
Dec Hex Binary 0 0 0000 1 1 0001 2 2 0010 3 3 0011 4 4 0100 5 5 0101 6 6 0110 finish to 15 7 7 0111 |
8 8 1000 9 9 1001 10 A 1010 11 B 1011 12 C 1100 13 D 1101 14 E 1110 15 F 1111 |
|
|
Convert 0x59 from Hex to binary |
Convert 0101 1001 from binary to hex |
|
|
convert 79 from decimal to binary |
0 79 - 64 = 15 1 32 0 16 0 15 - 8 = 7 1 7 - 4 = 3 1 3 - 2 = 1 1 1 - 1 = 0 1 |
|
|
convert 0101 0100 to decimal |
1*2^2 + 1*2^4 + 1*2^6 = 4 + 16 + 64 = 84 |
|
|
0110 + 0011 = |
1001 |
|
|
1101 * 0101 = |
1101 * 0101 1101 0 110100 0 = 1000001 |
|
|
Know about bit level operators and masks |
<<,>>,&,|, ~ Masking is when we use bit lv. logical operators to set the bits that are not important to zero. |
|
|
Translate -77 to two's complement signed char binary |
char is 8 bits. it can hold 2^(8-1) = 128. 128 - 77 = 51. Then translate 51 to binary, and set the leftmost digit to 1 for negative. You get 1011 0011. |
|