Main Page → Problems → Solve a Problem

Self-Check 1.2: binary 1

• Hint: Binary numbers use 0 and 1 as their only digits.
• Hint: Each digit in a binary number represents a power of 2. From the right, the digits are worth 1, then 2, then 4, 8, 16, and so on.
• Hint: The number 12 in binary would have the representation 1100, because that represents (1*8) + (1*4) + (0*2) + (0*1).
• Hint: To find a number's binary representation, repeatedly subtract out the largest power of 2 that you can until you have consumed the entire number. Each power of 2 that you pull out will correspond to a 1 in the binary number.
• Hint: Every binary number other than 0 will start with 1.

Is there a problem?
Contact a Practice-It administrator.

Practice-It! web application and problems are copyright © Marty Stepp unless otherwise specified. Problems from Building Java Programs textbook are copyright © Pearson. Any non-educational usage of the content on this site is expressly forbidden without written permission. All rights reserved.