• Post Reply Bookmark Topic Watch Topic
  • New Topic

converting to decimal but without using integer.parseInt() method  RSS feed

 
sara james
Greenhorn
Posts: 13
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
hello guys!
so this is my first programming course and i have an assignment to convert a binary number entered by the user to a decimal. and my binary number should be stored in a a string.
and to check that all my digits are 1s and 0s i need to use a method to make sure it's valid and return true if the the number is correct and false otherwise.
so i did a search and saw that everyone was using the integer.parseInt(String , int radix) method to convert a binary string to int which worked completely fine, however, the only problem is we didn't take this with my professor so I'm not sure if it's OK and that maybe he wants another way to convert ? so my question is: how can i write this code in another way that doesn't use this method?.
here's my code:


this is my output:

enter a binary number to convert to decimal:
110101
the equivalent decimal value is: 53


thank you in advance
 
Joel Christophel
Ranch Hand
Posts: 250
1
Chrome Eclipse IDE
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
I'd assume that your teacher doesn't want you using the parseInt method.

So how will you write a method to do it yourself? Well first, you need to sit down and think how you yourself would convert a binary number to decimal. How did you get 53 from 110101?

It might help if you wrote down the steps in English.
 
Knute Snortum
Sheriff
Posts: 4279
127
Chrome Eclipse IDE Java Postgres Database VI Editor
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
You might want to just check for the index of "1" and the index of "0" in the string. Looking at the documentation for the methods of java.lang.String (← that's a link) will show the way.
 
Campbell Ritchie
Marshal
Posts: 56546
172
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
There is a standard method for interconversions between binary and decimal. It has to do with ÷ 2 and × 2 but I can't remember how to do it just at the moment.
 
sara james
Greenhorn
Posts: 13
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
"So how will you write a method to do it yourself? Well first, you need to sit down and think how you yourself would convert a binary number to decimal. How did you get 53 from 110101?

It might help if you wrote down the steps in English. "

i understand that the right most digit has the value 2^0 so working my way to the left it would be: 110101 and taking the 1s only:
53 = 2^5 + 2^4 + 2^3 + 2^0

but i don't know how to write that in java ??

edit: i also saw people using math.pow thingy but we really didn't take that or how to actually write powers so i'm really confused.
 
Henry Wong
author
Sheriff
Posts: 23295
125
C++ Chrome Eclipse IDE Firefox Browser Java jQuery Linux VI Editor Windows
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
sara james wrote:
i understand that the right most digit has the value 2^0 so working my way to the left it would be: 110101 and taking the 1s only:
53 = 2^5 + 2^4 + 2^3 + 2^0

but i don't know how to write that in java ??


You can do it with a loop, that is very similar to the one in the validBinary() method. Of course, you have a bit of math to do -- which will require calculating based on the index of the loop. I recommend working it out on paper first, as it will be much easier to envision when you draw it out.

Henry
 
Campbell Ritchie
Marshal
Posts: 56546
172
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
If you iterate the String from right to left, I think the arithmetic becomes quite straightforward.
 
Stephan van Hulst
Saloon Keeper
Posts: 7987
143
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
In my opinion, it's easier to start with the leftmost non-zero bit in the string, and multiply an accumulator by two after adding the value of the bit to it, for each remaining bit.
 
Campbell Ritchie
Marshal
Posts: 56546
172
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
That sounds easy too. You probably don't need to look for non‑zero bits; it is probably easier to add 0 a few times if there are leading 0s.
You would need to convert from numbers in the String to bits, and one way to do it is to remember that a char is not a letter but a number and you can subtract two chars.
 
Liutauras Vilda
Sheriff
Posts: 4918
334
BSD
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
sara james,

Guys gave some useful hints. Did you come up with solution?
p.s. I've got mine (different one).

Show what you got so far, will try to help you.
 
  • Post Reply Bookmark Topic Watch Topic
  • New Topic
Boost this thread!