CSCI 223 Quiz 3

Question 1

how to convert from decimal to hexadecimal

Answer 1

divide by 16, read the remainders from bottom to top

Question 2

how to convert from decimal to binary

Answer 2

divide by 2, use the remainders from bottom to top (should be 0s and 1s)

Question 3

how to convert from hexadecimal to decimal

Answer 3

label the positions from right to left as 0, 1, 2, … and multiply the number by 16^? and add the results together

Question 4

how to convert from binary to decimal

Answer 4

label the positions from right to left as 0, 1, 2, … and multiply the number by 2^? and add the results together

Question 5

how to convert from binary to hexadecimal or binary to hexadecimal

Answer 5

use the chart

Question 6

0x0

Answer 6

0000

Question 7

0x1

Answer 7

0001

Question 8

0x2

Answer 8

0010

Question 9

0x3

Answer 9

0011

Question 10

0x4

Answer 10

0100

Question 11

0x5

Answer 11

0101

Question 12

0x6

Answer 12

0110

Question 13

0x7

Answer 13

0111

Question 14

0x8

Answer 14

1000

Question 15

0x9

Answer 15

1001

Question 16

0xA

Answer 16

1010

Question 17

0xB

Answer 17

1011

Question 18

0xC

Answer 18

1100

Question 19

0xD

Answer 19

1101

Question 20

0xE

Answer 20

1110

Question 21

0xF

Answer 21

1111

Question 22

Little Endian ordering

Answer 22

least significant byte (furthest to the right) has lowest address

Question 23

pointer

Answer 23

a variable whose content is a memory address

Question 24

how to declare a pointer

Answer 24

int *p;

Question 25

and chart

Answer 25

& 0 1 0 0 0 1 0 1

Question 26

or chart

Answer 26

| 0 1 0 0 1 1 1 1

Question 27

not chart

Answer 27

0 1 | ~ 1 0

Question 28

exclusive or chart

Answer 28

^ 0 1 0 0 1 1 1 0

Question 29

logical operations in C (logical and, logical or, logical not)

Answer 29

&&, ||, !

Question 30

view zero as (true/false) and anything nonzero as (true/false)

Answer 30

false, true

Question 31

for logical or, you want to place the more likely term to be (0 or 1) first

Answer 31

1

Question 32

for logical and, you want to place the more likely term to be (0 or 1) first

Answer 32

0

Question 33

left shift x << y will

Answer 33

shift bit-vector x left by y positions: throw away extra bits on left and will with 0's on the right; similar to multiplication by 2^x

Question 34

right shift x >> y will

Answer 34

shift bit-vector x right by y positions; similar to division by power of 2

Question 35

logical right shift

Answer 35

fill with zero's on the left

Question 36

arithmetic right shift

Answer 36

replicate the most significant bit to the right on the left