Wrox Programmer Forums

Need to download code?

View our list of code downloads.

Go Back   Wrox Programmer Forums > C# and C > C++ and Visual C++ > C++ Programming
Password Reminder
Register
| FAQ | Members List | Calendar | Search | Today's Posts | Mark Forums Read
C++ Programming General discussions for the C++ language. For questions specific to Microsoft's Visual C++ variant, see the Visual C++ forum instead.
Welcome to the p2p.wrox.com Forums.

You are currently viewing the C++ Programming section of the Wrox Programmer to Programmer discussions. This is a community of tens of thousands of software programmers and website developers including Wrox book authors and readers. As a guest, you can read any forum posting. By joining today you can post your own programming questions, respond to other developers’ questions, and eliminate the ads that are displayed to guests. Registration is fast, simple and absolutely free .
DRM-free e-books 300x50
Reply
 
Thread Tools Search this Thread Display Modes
  #1 (permalink)  
Old March 16th, 2004, 09:26 AM
Authorized User
 
Join Date: Mar 2004
Location: Mount Waverley, Victoria, Australia.
Posts: 33
Thanks: 0
Thanked 1 Time in 1 Post
Default conversion

I am writing code to convert a negative binary number to its positive counterpart. The code below doesn't do the conversion properley. Can anyone please help??

#define SIZE 8
void Converter(int binary[])
{
int num[SIZE];

for(count = SIZE - 1; count >= 0; cout--)
{
  if(binary[0] = '1'); // is negative
   sum[count] = 0; // this making everything to zero
} // end for
}



George N. Bilios
__________________
gbilios
Reply With Quote
  #2 (permalink)  
Old March 16th, 2004, 09:45 AM
Authorized User
 
Join Date: Jun 2003
Location: , , Norway.
Posts: 95
Thanks: 0
Thanked 0 Times in 0 Posts
Default

I don't know if I can help you with your original problem, but I see some potensial problems in you code:

 
Quote:
quote:#define SIZE 8
Quote:
void Converter(int binary[])
{
int num[SIZE];

for(count = SIZE - 1; count >= 0; cout--)
{
  if(binary[0] = '1'); // is negative
   sum[count] = 0; // this making everything to zero
} // end for
}
Where do you use the num array?
The for-loop will go for ever, since count is not decremented (spelling error most likely).
Where is sum decleared?

Gert
Reply With Quote
  #3 (permalink)  
Old March 16th, 2004, 11:11 AM
Authorized User
 
Join Date: Mar 2004
Location: Mount Waverley, Victoria, Australia.
Posts: 33
Thanks: 0
Thanked 1 Time in 1 Post
Default

I cant get the code to convert a negative binary number to its positive equivalent, which should add 1 and then convert to decimal. The main issue hgere is that I want the code to be able to turn the zeros into ones and the ones into zeros, egs, 10001100(negative) is converted to 01110011(positive)

#define SIZE 8

int toDecimal(int binary[])
{
int num[SIZE];
int decimal = 0;
int weight = 1;
int num;
int count;
for (count = SIZE -1;count >= 0; count--)
{
  if(binary[0] == '0') // is positive, convert to decimal
  {
         // num = binary % 10;
         num = binary[count];
         decimal = decimal + num * weight ;
         // binary = bianry / 10;
         weight = weight * 2;
   }
   else if (binary[0] == '1')
   {
     // is negative and must be converted to positive
     // equivalent, add 1, and then convert to decimal.
     //....
} // end for
return decimal;
} // end function



George N. Bilios
Reply With Quote
  #4 (permalink)  
Old March 17th, 2004, 08:33 PM
Friend of Wrox
Points: 2,570, Level: 21
Points: 2,570, Level: 21 Points: 2,570, Level: 21 Points: 2,570, Level: 21
Activity: 0%
Activity: 0% Activity: 0% Activity: 0%
 
Join Date: Jun 2003
Location: San Diego, CA, USA
Posts: 836
Thanks: 0
Thanked 0 Times in 0 Posts
Default

Uh, why not just xor with all ones? Why use an array of integers at all? That's an incredible waste of space -- to use an entire integer to contain a 1 or 0.

Also, why are you making comparisons to characters? '1' and '0' are characters. This would make sense if your int array, "binary", is actually an array of characters, but that's not how it's declared.

Next issue: Why is your function called "toDecimal" if what you're really doing is taking the bit inverse? It's misleading.

And what the heck does your "weight" variable have to do with anything? Multiplying by two is the same as shifting a binary number to the left once. Why not use a bit shifting operation instead of multiplication?

Why not just multiply your running sum by 2 each iteration, instead of figuring out just one bit, multiplying that by the appropriate power of 2, then adding it to the running sum?


Let me rephrase the above using code:

int num = 0;
for (count = 0; count < SIZE; ++count)
{
    num *= 2; // shift left.
    num += (binary[count] == '1')? 0 : 1
}

Isn't that easier than dealing with three different variables?


Take care,

Nik
http://www.bigaction.org/
Reply With Quote
  #5 (permalink)  
Old March 18th, 2004, 05:28 AM
Authorized User
 
Join Date: Mar 2004
Location: Mount Waverley, Victoria, Australia.
Posts: 33
Thanks: 0
Thanked 1 Time in 1 Post
Default

the first thing thats suppose to happen in toDecimal is convert a binary number to positive, only if the binary number is a positive. if the binary number was a negative it would convert it to a positive, add 1 (two's complement), then convert to decimal(result).

The original function toDecimal converted a binary number to decimal.
all i did was add code to it so i could enter a two's complement number
and deal with it. obviously my code is wrong.

thanks for helping me.





George N. Bilios
Reply With Quote
  #6 (permalink)  
Old March 18th, 2004, 07:05 AM
Authorized User
 
Join Date: Mar 2004
Location: Mount Waverley, Victoria, Australia.
Posts: 33
Thanks: 0
Thanked 1 Time in 1 Post
Default

one point though, in two's complement, a negative binary number is first converted to positive, and then a 1 is added to the rightmost bit. The code you rephrased does not add a one to the rightmost bit of the result:

int count;
int num = 0;
for (count = 0; count < SIZE; ++count)
{
    num *= 2; // shift left.
    num += (binary[count] == '1')? 0 : 1;
} // end for



George N. Bilios
Reply With Quote
  #7 (permalink)  
Old August 6th, 2004, 06:13 PM
Friend of Wrox
 
Join Date: Jul 2004
Location: Tehran, , Iran.
Posts: 623
Thanks: 0
Thanked 1 Time in 1 Post
Default

after five months ;)
yes you are right after above code,write below code
Code:
count=size-1;
while(binary[count])
{
binary[count])=0;
count--;
}
binary[count])=1;
--------------------------------------------
Mehdi.:)
Reply With Quote
Reply


Thread Tools Search this Thread
Search this Thread:

Advanced Search
Display Modes

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is Off
HTML code is Off
Trackbacks are Off
Pingbacks are On
Refbacks are Off


Similar Threads
Thread Thread Starter Forum Replies Last Post
conversion... ankur_icfai Flash (all versions) 1 November 9th, 2006 10:38 AM
Conversion anukagni Access 2 September 6th, 2006 12:22 AM
VB to C# conversion shazia1 VS.NET 2002/2003 3 June 29th, 2005 08:12 PM
DataType Conversion using WHERE IN ( ) Colonel Angus SQL Language 3 August 18th, 2004 07:43 AM



All times are GMT -4. The time now is 10:34 AM.


Powered by vBulletin®
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.
© 2013 John Wiley & Sons, Inc.