Question 1 (1 point)

Suppose the variable x has the value shown. Determine the result of the indicated right arithmetic shift operation(s) as a single byte in hexadecimal.

int x = 0x9A; x >> 3

Question 1 options:

	none of these
	0xF3
	0xA9
	0x8F
	0xFE

View hint for Question 1

Save

Question 2 (1 point)

The largest unsigned value that may be represented using 6 bits is 63.

Question 2 options:

	True
	False

Save

Question 3 (2 points)

Suppose a computer used 5 bit arithmetic. Which one of the following expressions would result in an overflow condition?

Question 3 options:

	-7 + -8
	-8 + -3
	-6 + 12
	4 + 12
	none of these

Save

Question 4 (1 point)

Which one of the following is the binary form of the 2's complement representation of the value of x using 5 bits.

int x = 5;

Question 4 options:

	10101
	00101
	00011
	11011
	none of these

Save

Question 5 (1 point)

Which one of the following is the binary form of the 2's complement representation of the value of x using 5 bits.

int x = -4;

Question 5 options:

	none of these
	10101
	00100
	11100
	00011

Save

Question 6 (2 points)

Which one of the following is the smallest number of bits that can be used to represent the value -12 in 2's complement?

Question 6 options:

	6
	4
	5
	none of these
	3

Save

Question 7 (1 point)

Which one of the following is the largest number than be represented using an unsigned encoding using 7 bits?

Question 7 options:

	128
	none of these
	64
	127
	63

Save

Question 8 (1 point)

The 2's complement encoding is symmetric with respect to positive and negative values, that is: it allows the same number of positive and negative values to be represented.

Question 8 options:

	True
	False