heyharshna

What is the formula for finding the largest SIGNED binary value for a given number of bits?

(2^(N-1))-1

What is the formula for finding the smallest SIGNED binary value for a given number of bits? Note: N represents the number of bits in the formula A) -1 * (2^N) B) -1 * (2^(N-1)) C) -1 * ((2^(N-1))-1) D) -1 * ((2^N)-1)

-1 * (2^(N-1))

What is the SIGNED binary number 10000000 converted to decimal? A: 256 B: -256 C: 128 D: -128

-128

What is the SIGNED hexadecimal number 80 converted to decimal? A: 128 B: -256 C: 256 D: -128

-128

What is the smallest SIGNED number that can be represented with 8 binary bits A) -128 B) -127 C) -255 D) -256

-128

Suppose we have the following UNsigned binary number: 10 And we want to sign-extend this binary number to four binary bits. The binary number MUST have the same value, but now it will be four binary bits rather than two. Which of the options below is correct? A) 1010 B) 1110 C) 0110 D) 0010

0010

Suppose we want to represent the decimal number 19 as a SIGNED binary number using the least number of bits possible. Which of the options below is correct? A) 100011 B) 010011 C) 10011 D) 0100011

010011

Suppose we have run through the signed -> signed hexadecimal conversion algorithm. The original decimal number that we wanted to convert to hexadecimal was a NEGATIVE number, but we ran through the algorithm with the positive equivalent (e.g., if the decimal number was-26 then we would run through the algorithm with +26, etc.). After building the table, suppose we have 7 for the MSH in the remainder column of the table: 1. We must to add a leading 0 to the hexadecimal number in the remainder column of the table. For example, if the hexadecimal number in the remainder column of the table is 7C, then we need to make it 07C. 2. After evaluating statement number 1 above, the result needs to be run through two's complement. * *NOTE: If you answered false for statement number 1, then "the result" would mean just the number from the remainder column of the table. If you answered true for statementnumber 1, then "the result" would mean a leading 0 followed by the number from the remainder column of the table. A: 1. True 2. False B: 1. False 2. False C: 1. False 2. True D: 1. True 2. True

1. False 2. True

To do the subtraction A-B between two binary numbers, we can: 1) Do the addition A + B 2) Discard the carry out of the MSB if there is one A: 1. True 2. False B: 1. False 2. True C: 1. False 2. False D: 1. True 2. True

1. True 2. True

What are the two steps to get the two's complement of a binary number? 1. For each binary bit i, perform: _ 2. _ A: 1. flipped_bit[i] = 1 - bit [i] 2. Subtract 1 B: 1. flipped_bit[i] = bit[i] - 1 2. Subtract 1 C: 1. flipped_bit[i] = 1 - bit[i] 2. Add 1 D: 1. flipped_bit[i] = bit[i] -1 2. Add 1

1. flipped_bit[i] = 1 - bit[i] 2. Add 1

What are the two steps to get the two's complement of a hexadecimal number? 1. For each hexadecimal symbol i, perform: _ 2. _ A: 1. flipped_hex[i] = hex[i] - 15 2. Subtract 1 B: 1. flipped_hex[i] = hex[i] - 15 2. Add 1 C: 1. flipped_hex[i] = 15 - hex[i] 2. Add 1 D: 1. flipped_hex[i] = 15 - hex[i] 2. Subtract 1

1. flipped_hex[i] = 15 - hex[i] 2. Subtract 1

When adding binary numbers together in an colum, what two steps are performed if their sum is greater than 1? 1. What you put down in the column is calculated by the formula: _ 2. Carry a 1 over to the next column HINT: 1 + 1 = 10 1 + 1 + 1 = 11 A: 1. sum = 1 mod sum B: 1. sum = 2 mod sum C: 1.sum = sum mod 2 D: 1. sum = sum mod 1

1. sum = sum mod 2

What is the smallest SIGNED binary number that you can make with six (6) bits?

100000

Suppose we want to represent the decimal number 65 as an UNsigned binary number using the least number of bits possible. which of the options below is correct? A) 1000001 B) 010000001 C) 10000001 D) 01000001

1000001

what is the largest SIGNED number that can be presented with 8 binary bits? a)128 b)255 c)127 d)256

127

What is the UNsigned hexadecimal number 80 converted to decimal? A) 256 B) -256 C) 128 D) -128

128

Suppose n = number of hexadecimal symbols. Which of the options below is the correct formula that will give you the largest UNsigned hexadecimal number that you can represent for a given number of hexadecimal symbols? A. 16^(n+1) + 1 B. 16^n + 1 C. 16^n - 1 D. 16^(n-1) - 1

16^n - 1

AB +CD What is the sum of the hexadecimal numbers shown above? A: F79 B: 189 C: 178 D: F58

178

Suppose n = number of bits. Which of the options below is the correct formula that will give you the largest UNsigned binary number that you can represent for a given number of bits? A. 2^n + 1 B. 2^(n-1) - 1 C. 2^(n+1) + 1 D. 2^n - 1

2^n - 1

What is the largest UNsigned number you can make with five (5) bits? A) 16 B) 32 C)31 D)15

31

Which of the following options below describes the correct algorithm for converting an UNsigned decimal number to binary? 1. Divide the number by 2 2. Calculate and store the quotient 3. Calculate and store the remainder 4. Set number = _ 5. If the _ is not equal to 0, go back to step 1, else go to step 6 6. The binary number is stored in the remainder A) 4. quotient 5. remainder B) 4. remainder 5. quotient C) 4. remainder 5. remainder D). 4. quotient 5. quotient

4. quotient 5. quotient

Which of the options below is the largest SIGNED hexadecimal number that you can make with two (2) hexadecimal symbols A: 8F B: 7F C: FF D: 0F

7F

How many bits are in a byte? A: 16 B: 64 C: 8 D: 32

8

Which of the options below is the largest UNsigned hexadecimal number that you can make with two (2) hexadecimal symbols A) 8F b) 7F C) FF D) 0F

FF

Which of the following is the correct SIGNED hexadecimal representation of -6? A) 1FA B) 11A C) FFA D) F1A

FFA

When adding hexadecimal numbers together in a column, what two steps are performed if their sum is greater than 15? 1. What you put down in the column is calculated by the formula: _ 2. Carry a 1 over to the next column A. sum = 15 mod sum B. sum = sum mod 15 C. sum = sum mod 16 D. sum = 16 mod sum

c: sum = sum mod 16