Search Header Logo

Understanding n-bit and Two's Complement

Authored by Tsz Kin Leung

Computers

10th Grade

Used 2+ times

Understanding n-bit and Two's Complement
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

2 mins • 5 pts

What is the range of an n-bit signed integer using two's complement?

[-2^(n-1), 2^(n-1) - 1]

[0, 2^n - 1]

[-2^n, 2^n]

[-2^(n-1) - 1, 2^(n-1)]

2.

MULTIPLE CHOICE QUESTION

2 mins • 5 pts

How many unique values can an 8-bit unsigned integer represent?

128

512

256

64

3.

MULTIPLE CHOICE QUESTION

2 mins • 5 pts

What is the two's complement representation of -5 in 8 bits?

11110111

11111010

11111100

11111011

4.

MULTIPLE CHOICE QUESTION

2 mins • 5 pts

How do you convert the binary number 11001010 to decimal?

192

175

210

202

5.

MULTIPLE CHOICE QUESTION

2 mins • 5 pts

What is the decimal equivalent of the 8-bit binary number 00001111?

5

10

15

20

6.

MULTIPLE CHOICE QUESTION

2 mins • 5 pts

What is the maximum positive value for an 8-bit signed integer?

128

255

127

-128

7.

MULTIPLE CHOICE QUESTION

2 mins • 5 pts

How do you determine if an 8-bit binary number is positive or negative?

Convert the binary number to decimal and check if it's greater than 128.

Check the most significant bit: 0 is positive, 1 is negative.

Check the least significant bit: 0 is negative, 1 is positive.

Count the number of 1s in the binary number; if it's odd, it's negative.

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?