Assembly Final Review Flashcards

1
Q

Unsigned integer

A

Integers that can only represent nonnegative whole numbers. Ex: an 8 bit unsigned integer can represent values 0 from 255.

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

Horner’s scheme

A

A method to evaluate decimal values of a number. Start with writing the first number of the number times 1 minus the length of the number until you get to 0. If its not binary then multiply by the base.

Ex: 10010011
(1x2^7)+(0x2^6)+(0x2^5)+…+(1x2^0)
–>((((((1x2+0)2+0)2+1)…))))))

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

2’s complement

A

Binary representation scheme used for signed integers. Positive numbers are the same as sign magnitude. For negative numbers, invert all the bits and add 1.

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

Bitwise operations

A

And, Or and Xor

And returns 1 if both bits are 1, Or returns 1 if either are 1, and Xor returns 1 if either are 1 but not both

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

What is Unicode?

A

A coding scheme on how to represent characters using 16 bits or more

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

How do you convert decimal (base 10) to binary?

A

Repeated division method

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

Signed integer

A

Can represent both pos and neg integers

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

How to represent numbers in sign magnitude

A

Find out how many bits youll need by finding what power you need for 2. The result can’t be bigger than the number. Ex: 468, 2^8 = 256, 2^9 = 512 which is too big. Subtract 256 from 468 and if the result is positive then add 1 to the beginning of binary num, 0 otherwise.

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

Sign magnitude

A

For positive numbers, the sign bit is 0 and 1 for negative numbers

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

One’s complement

A

Same as sign magnitude but inverted

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

Instruction

A

Task in mips with 2 main parts, opcode and operand

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

Register

A

Fastest kind of storage device located on processor

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

Bit shifting

A

Moving bits of a binary number left or right.

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

CISC

A

Complex Instruction Set Computing: supports a large set of complex instructions

Advantages: Can do complex operations in 1 instruction
Disadvantages: Increased complexity can lead to longer runtimes and higher costs

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

RISC

A

Reduced Instruction Set Computing: supports smaller set of simple instructions

Advantages: Simplified instruction set allows for easier pipelining and faster execution
Disadvantages: May require more instructions to do complex operations

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

Fetch-decode-execute

A

CPU retrieves instruction from memory and stores it in the PC (program counter). CPU then sends address from PC to memory and stores instruction in IR.

CPU then interprets the opcode and specifies the operation to be performed

Instruction is then executed

17
Q

Pipelining

A

Overlapping the execution of multiple instructions to improve throughput of instruction execution

18
Q

ISA

A

Instruction Set Architecture, A set of rules and conventions that define the interface between hardware and software. Includes instructions, registers, data types and addressing modes