How many bits are necessary for a binary representation (unsigned) of:

Computers and Technology

1 answer:

pshichka [43]3 years ago

4 0

Answer:

Hi!

The answer to:

a. 6 bits.

b. 9 bits.

c. 26 bits.

Explanation:

a. For the states of the U.S.A, you need 50 or more combinations to represents each element.

If you use 6 bits, the possible combinations are 2⁶ = 64.

b. For days in a year, you need 365 or more combinations to represents each element.

If you use 9 bits, the possible combinations are 2⁹ = 512.

c. For inhabitants of California, you need 36,457,549 or more combinations to represents each element.

If you use 26 bits, the possible combinations are 2²⁶ = 67,108,864. If you use 25 bits instead of 26, then you have 2²⁵ = 33,554,432 combinations. These possible combinations are not enough to represent each inhabitant.

You might be interested in

What command enables you to initialize quotas on a file system?

jeka57 [31]

Quotas can be enabled by mounting a partition with the usrquota (and optionally the grpquota) mount option(s).Normally this is done by editing /etc/fstab and adding usrquota to the mount options part of the entry for some filesystem.Then that filesystem must be remounted ("mount -o remount filesystem").

4 0

3 years ago

Can you help me with these AP Computer Science Questions. (THIS IS DUE BY 1:30 PM today) you have to evaluate the Boolean Expres

vfiekz [6]

Answer + Explanation:

'and' -> both statements are 'True' to evaluate as 'True'.

'or' -> at least one statement is 'True' to evaluate as 'True'.

1. True (grade has the value of 82, so the statement evaluates to 'True').

2. True (Both statements are true, this expression evaluates to 'True').

3. False (Both statements are false, this expression evaluates to 'False').

4. True (the != operator means not equal. Since the 'name' variable holds the string 'Rumpelstiltskin', name != 'Rumpelstiltskin' evaluates to 'False'. The 'not' operator returns the opposite of the given Boolean expression, so this expression evaluates to 'True').

5. True (name == 'Rumpelstiltskin' evaluates to 'True', so this expression is true).

6. False (All statements evaluate to 'False').

7. True (All statements evaluate to 'True').

8. False (All statements evaluate to 'True' except for not(x == - 3) which evaluates to 'False', so the whole statement now becomes false).

9. True (grade+5 < 90 and grade >= 80 evaluates to 'True', so this whole expression becomes true).

10. True (grade > 0 and x % 2 == 1 evaluates to 'True')

Hope this helps :)

7 0

3 years ago

Spam is _____.

AfilCa [17]

Multiple answers. Attachment and practice of sending unwanted messages