Computer Organization Exam 1 Whaley

Front 1

How Many bits in a Byte?

Back 1

8

Hint 1

An internet speed of 24 mb is only 3 mB. Careful when choosing internet provider.

Front 2

Size of Char?

Back 2

1 Byte

Front 3

ILP

Back 3

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.

Front 4

CPI

Back 4

Clocks Per Instruction ( or Cycles PI)

Front 5

ALU vs. FPU

Back 5

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.

Front 6

PE

Back 6

Processing Element (e.g. FPU, ALU, etc.)

Front 7

ISA

Back 7

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.

Front 8

CISC v.s RISC

Back 8

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.

Front 9

VLIW

Back 9

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.

Front 10

CMP

Back 10

A Chip Multiprocessor is a multi-core processor.

Front 11

multi-issue

Back 11

Ability to perform more than 1 instruction at once.

Front 12

Draw Computer Organization Chart

Back 12

http://deploy.virtual-labs.ac.in/labs/cse10/images/comp5.png

Front 13

Memory Hierarchy ( visually from top to bottom)

Back 13

Disk.

Main memory

last cache

...

Cache2

Cache1

Registers

Front 14

Process

Back 14

thread of execution wt its own state, including entire virtual memory.

Front 15

state

Back 15

all the stored information, at a given instant in time, to which the circuit or program has access.

Front 16

thread

Back 16

a thread of execution with its own stack & regs but possibly hares much of its state with other threads.

Front 17

Virtual Memory

Back 17

Illusion given to program that it has entire memory address space to itself

Front 18

Stack Starts...

Back 18

Typically stack starts at high and grows downward

Front 19

Heap Starts....

Back 19

Typically heap starts at low and grows upward.

Front 20

sizeof(int), sizeof(float)

Back 20

32 bits

Front 21

sizeof(long)

Back 21

32 or 64 bits.

Depends on if compiled for 32 or 64.

Front 22

sizeof(long long), sizeof(double)

Back 22

64 bits

Front 23

sizeof(char)

Back 23

1 Byte

Front 24

automatic variables

Back 24

Declared in scope, accessible only in scope, stop existing when scope execution finishes.

Front 25

sizeof(short)

Back 25

16 bits

Front 26

private global variables

Back 26

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.

Front 27

Unsigned int

Back 27

Unsigned can hold a larger positive value, and no negative value. Leftmost bit is normal.

Front 28

Signed int

Back 28

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.

Front 29

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

Back 29

8 8 1000

9 9 1001

10 A 1010

11 B 1011

12 C 1100

13 D 1101

14 E 1110

15 F 1111

Front 30

Convert 0x59 from Hex to binary

Back 30

Convert 0101 1001 from binary to hex

Front 31

convert 79 from decimal to binary

Back 31

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

Front 32

convert 0101 0100 to decimal

Back 32

1*2^2 + 1*2^4 + 1*2^6 = 4 + 16 + 64 = 84

Front 33

0110 + 0011 =

Back 33

1001

Front 34

1101 * 0101 =

Back 34

1101

* 0101

1101

0

110100

0 = 1000001

Front 35

Know about bit level operators and masks

Back 35

<<,>>,&,|, ~

Masking is when we use bit lv. logical operators to set the bits that are not important to zero.

Front 36

Translate -77 to two's complement signed char binary

Back 36

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.