Problem

1. Convert the following unsigned binary numbers to decimal
   1. 11111₂
   2. 10101₂
   3. 100₂
   4. 110₂
2. Convert the following decimal numbers to binary (You may use as many binary digits as necessary)
   1. 256¹⁰
   2. 2467¹⁰
   3. 1023¹⁰
   4. 23¹⁰
   5. 7¹⁰
3. Convert the following binary numbers to hexadecimal
   1. 1101 0010 1101 1111
   2. 1100 0101 0010 1001
   3. 1000 0000 0000 0001
   4. 0001 1000 0000 0000
4. Given n bits, how many unsigned binary numbers can be represented?
5. Given n bits, how many signed binary numbers can be represented using the twos compliment method?
6. In the twos complement method, why is there one more negative number than there are positive numbers?