C_Systems CH. 1 & 3 (INTRO | INFO REP)

Question 1

R.A.M

Answer 1

Random Access Memory

Question 2

Digital

Answer 2

SET # of positions

Question 3

Analog

Answer 3

Infinite # of positions

Question 4

Binary

Answer 4

Only TWO # of Positions (IE: On or Off | 1 0r 0)

Question 5

BIT

Answer 5

Single Binary Digit

Question 6

BYTE

Answer 6

Eight Bits

Question 7

NIBBLE

Answer 7

Four Bits

Question 8

WORD

Answer 8

Refers to HOW much DATA a computer can process in a single step.

Question 9

Low Order / Least Sig.

Answer 9

RIGHT

Question 10

High Order / Most Sig.

Answer 10

LEFT

Question 11

How Big Can We Get? **Formula (Determine smallest, highest and number of possible values for N amount of bits)

Answer 11

n = # of bits | 0 = smallest value | 2^n -1 highest value | 2^n = # of values possible

Question 12

Convert NEG. Twos Comp.

Answer 12

Add all 0 places and add 1 | I.E: 10011110 –> 1+32+64 = 97 + 1 –> 98 = -98

Question 13

OverFlow (V)

Answer 13

when two numbers w/ SAME sign added and results in OPPOSITE sign

Question 14

Logical Ops ( AND | OR )

Answer 14

Question 15

Arithmetic Shift Left

Answer 15

Old leftmost bit moves into the carry bit

New right most bit is a 0

DOUBLES the number

I.E: 00111010 –> 01110100

Question 16

Arithmetic Shift Right (ASR)

Answer 16

Right most bit shifted into the carry bit

Left most bit is repeated

DIVIDES by two

I.E: 01101111 –> 00110111

Question 17

BITWise OPS

Answer 17

<< - ASL

>>- ASR

~ - NOT

& - Bitwise AND

- Bitwise OR