Fix the errors in the following C++ program, so that it compiles in the putty te

Question

Fix the errors in the following C++ program, so that it compiles in the putty terminal. Show proof that it compiles and runs with a sample run.

#include<iostream>
#include <stdlib.h>
//#include<cstdlib.h>
#include<cmath>
#include<time.h>
using namespace std;
using std::string;
#define CROSS 0.7
#define MUTATION 0.001
#define POPS 100
#define CHROM_LNT 300
#define GENE_LNT 4
#define ALLOW_GEN 400
#define RAND (float)rand()/(RAND_MAX+1)
struct chromType
{
string bit;
float fitties;
chromType(): bit(""), fitties(0.0f){};
chromType(string bts, float ftns): bit(bts), fitties(ftns){}
};
void dispGeneSym(int values);
string getRand(int lnt);
int bin2Dec(string bit);
float assFit(string bit, int tarVal);
void dispChrom(string bit);
void dispGeneSym(int values);
int parsingBit(string bit, int* buff);
string Roulette(int totFit, chromType* polulat);
void Mutate(string &bit);
void Crossover(string &off1, string &off2);
int main()
{
srand((int)time(NULL));
while (true)
{
chromType polulat[POPS];
int targets;
int uu;
cout << " Input a target number: ";
cin >> targets;
cout << endl << endl;
for (uu=0; uu<targets;uu++)
{
polulat[uu].bit = getRand(CHROM_LNT);
polulat[uu].fitties = 0.0f;
}
int genForSoln = 0;
bool isFound = false;
while(!isFound)
{
float totFitties = 0.0f;
for(uu=0; uu<targets;uu++)
{
polulat[uu].fitties = assFit(polulat[uu].bit, targets);
totFitties += polulat[uu].fitties;
}
for (uu=0; uu<targets;uu++)
{
if (polulat[uu].fitties == 999.0f)
{
cout << " Solution found in " << genForSoln << "
generations!" << endl << endl;;
dispChrom(polulat[uu].bit);
isFound = true;
break;
}
}
chromType temporary[POPS];
int pops = 0;
while (pops < POPS)
{
string off1 = Roulette(totFitties, polulat);
string off2 = Roulette(totFitties, polulat);
Crossover(off1, off2);
Mutate(off1);
Mutate(off2);
temporary[pops++] = chromType(off1, 0.0f);
temporary[pops++] = chromType(off2, 0.0f);
}
for (uu=0; uu<<targets;uu++)
{
polulat[uu] = temporary[uu];
}
++genForSoln;
if (genForSoln > ALLOW_GEN)
{
cout << "No solutions found this run!";
isFound = true;
}
}
cout << " ";
}
return 0;
}
string getRand(int lnt)
{
string bit;
for (int uu=0; uu<lnt;uu++)
{
if (RAND > 0.5f)
bit += "1";
else
bit += "0";
}
return bit;
}
int bin2Dec(string bit)
{
int values = 0;
int addValues = 1;
for (int uu = bit.size(); uu > 0; uu--)
{
if (bit.at(uu-1) == '1')
values += addValues;
addValues *= 2;
}
return values;
}

int parsingBit(string bit, int* buff)
{
int cBuffer = 0;
bool bOps = true;
int genes = 0;
for(int uu=0; uu<<bit.size();uu++)
{
genes = bin2Dec(bit.substr(uu, GENE_LNT));
if (bOps)
{
if ( (genes < 10) || (genes > 13) )
continue;
else
{
bOps= false;
buff[cBuffer++] = genes;
continue;
}
}
else
{
if (genes > 9)
continue;
else
{
bOps = true;
buff[cBuffer++] = genes;
continue;
}

}

}
for (int uu=0;uu<bit.size();uu++)
{
if ( (buff[uu] == 13) && (buff[uu+1] == 0) )
buff[uu] = 10;
}
return cBuffer;
}

float assFit(string bit, int tarVal)
{
int buff[(int)(CHROM_LNT / GENE_LNT)];
int numOfElem = parsingBit(bit, buff);
float res = 0.0f;
for (int uu=0; uu < numOfElem-1; uu+=2)
{
switch (buff[uu])
{
case 10:
res += buff[uu+1];
break;
case 11:
res -= buff[uu+1];
break;
case 12:
res *= buff[uu+1];
break;
case 13:
res /= buff[uu+1];
break;
}

}
if (res == (float)tarVal)
return 999.0f;
else
return 1/(float)fabs((double)(tarVal - res));
return res;
}
void dispChrom(string bit)
{
int buff[(int)(CHROM_LNT / GENE_LNT)];
int numOfElem = parsingBit(bit, buff);
for (int uu=0; uu<<bit.size();uu++)
{
dispGeneSym(buff[uu]);
}
return;
}
void dispGeneSym(int values)
{
if (values < 10 )
cout << values << " ";
else
{
switch (values)
{
case 10:
cout << "+";
break;
case 11:
cout << "-";
break;
case 12:
cout << "*";
break;
case 13:
cout << "/";
break;
}
cout << " ";
}
return;
}
void Mutate(string &bit)
{
for (int uu=0; uu<<bit.size();uu++)
{
if (RAND < MUTATION)
{
if (bit.at(uu) == '1')
  bit.at(uu) = '0';
else
  bit.at(uu) = '1';
}

}
return;
}

void Crossover(string &off1, string &off2)
{
if (RAND < CROSS)
{
int crossings = (int) (RAND * CHROM_LNT);
string p1 = off1.substr(0, crossings) + off2.substr(crossings,
CHROM_LNT);
string p2 = off2.substr(0, crossings) + off1.substr(crossings,
CHROM_LNT);
off1 = p1; off2 = p2;
}
}
string Roulette(int totFit, chromType* polulat)
{
float slicing = (float)(RAND * totFit);
float fittiesSoFar = 0.0f;
for (int uu=0; uu<<totFit;uu++)
{
fittiesSoFar += polulat[uu].fitties;
if (fittiesSoFar >= slicing)
return polulat[uu].bit;
}
return "";
}

Explanation / Answer

Below is the compiled code

#include<iostream>

#include <stdlib.h>

#include <string>

#include<cmath>

#include<time.h>

using namespace std;

using std::string;

#define CROSS 0.7

#define MUTATION 0.001

#define POPS 100

#define CHROM_LNT 300

#define GENE_LNT 4

#define ALLOW_GEN 400

#define RAND (float)rand()/(RAND_MAX+1)

struct chromType

{

string bit;

float fitties;

chromType(): bit(""), fitties(0.0f){};

chromType(string bts, float ftns): bit(bts), fitties(ftns){}

};

void dispGeneSym(int values);

string getRand(int lnt);

int bin2Dec(string bit);

float assFit(string bit, int tarVal);

void dispChrom(string bit);

void dispGeneSym(int values);

int parsingBit(string bit, int* buff);

string Roulette(int totFit, chromType* polulat);

void Mutate(string &bit);

void Crossover(string &off1, string &off2);

int _tmain(int argc, _TCHAR* argv[])

{

srand((int)time(NULL));

while (true)

{

chromType polulat[POPS];

int targets;

int uu;

cout << " Input a target number: ";

cin >> targets;

cout << endl << endl;

for (uu=0; uu<targets;uu++)

{

polulat[uu].bit = getRand(CHROM_LNT);

polulat[uu].fitties = 0.0f;

}

int genForSoln = 0;

bool isFound = false;

while(!isFound)

{

float totFitties = 0.0f;

for(uu=0; uu<targets;uu++)

{

polulat[uu].fitties = assFit(polulat[uu].bit, targets);

totFitties += polulat[uu].fitties;

}

for (uu=0; uu<targets;uu++)

{

if (polulat[uu].fitties == 999.0f)

{

cout << " Solution found in " << genForSoln << "generations!" << endl << endl;

dispChrom(polulat[uu].bit);

isFound = true;

break;

}

}

chromType temporary[POPS];

int pops = 0;

while (pops < POPS)

{

string off1 = Roulette(totFitties, polulat);

string off2 = Roulette(totFitties, polulat);

if(!(off1.size() == 0) && !(off2.size() == 0))

{

Crossover(off1, off2);

}

Mutate(off1);

Mutate(off2);

temporary[pops++] = chromType(off1, 0.0f);

temporary[pops++] = chromType(off2, 0.0f);

}

for (uu=0; uu<targets;uu++)

{

polulat[uu] = temporary[uu];

}

++genForSoln;

if (genForSoln > ALLOW_GEN)

{

cout << "No solutions found this run!";

isFound = true;

}

}

cout << " ";

}

return 0;

}

string getRand(int lnt)

{

string bit;

for (int uu=0; uu<lnt;uu++)

{

if (RAND > 0.5f)

bit += "1";

else

bit += "0";

}

return bit;

}

int bin2Dec(string bit)

{

int values = 0;

int addValues = 1;

for (int uu = bit.size(); uu > 0; uu--)

{

if (bit.at(uu-1) == '1')

values += addValues;

addValues *= 2;

}

return values;

}

int parsingBit(string bit, int* buff)

{

int cBuffer = 0;

bool bOps = true;

int genes = 0;

for(int uu=0; uu<bit.size();uu++)

{

genes = bin2Dec(bit.substr(uu, GENE_LNT));

if (bOps)

{

if ( (genes < 10) || (genes > 13) )

continue;

else

{

bOps= false;

buff[cBuffer++] = genes;

continue;

}

}

else

{

if (genes > 9)

continue;

else

{

bOps = true;

buff[cBuffer++] = genes;

continue;

}

}

}

for (int uu=0;uu<bit.size();uu++)

{

if ( (buff[uu] == 13) && (buff[uu+1] == 0) )

buff[uu] = 10;

}

return cBuffer;

}

float assFit(string bit, int tarVal)

{

int buff[(int)(CHROM_LNT / GENE_LNT)];

int numOfElem = parsingBit(bit, buff);

float res = 0.0f;

int count = numOfElem - 1;

for (int uu=0; uu < count; uu+=2)

{

switch (buff[uu])

{

case 10:

res += (float)buff[uu+1];

break;

case 11:

res -= (float)buff[uu+1];

break;

case 12:

res *= (float)buff[uu+1];

break;

case 13:

res /= (float)buff[uu+1];

break;

}

}

if (res == (float)tarVal)

return 999.0f;

else

{

float f = (float)(1/(float)fabs((float)(tarVal - res)));

return f;

}

return res;

}

void dispChrom(string bit)

{

int buff[(int)(CHROM_LNT / GENE_LNT)];

int numOfElem = parsingBit(bit, buff);

for (int uu=0; uu<bit.size();uu++)

{

dispGeneSym(buff[uu]);

}

return;

}

void dispGeneSym(int values)

{

if (values < 10 )

cout << values << " ";

else

{

switch (values)

{

case 10:

cout << "+";

break;

case 11:

cout << "-";

break;

case 12:

cout << "*";

break;

case 13:

cout << "/";

break;

}

cout << " ";

}

return;

}

void Mutate(string &bit)

{

for (int uu=0; uu<bit.size();uu++)

{

if (RAND < MUTATION)

{

if (bit.at(uu) == '1')

bit.at(uu) = '0';

else

bit.at(uu) = '1';

}

}

return;

}

void Crossover(string &off1, string &off2)

{

if (RAND < CROSS)

{

int crossings = (int) (RAND * CHROM_LNT);

string p1 = off1.substr(0, crossings) + off2.substr(crossings,CHROM_LNT);

string p2 = off2.substr(0, crossings) + off1.substr(crossings,

CHROM_LNT);

off1 = p1; off2 = p2;

}

}

string Roulette(int totFit, chromType* polulat)

{

float slicing = (float)(RAND * totFit);

float fittiesSoFar = 0.0f;

for (int uu=0; uu<totFit;uu++)

{

fittiesSoFar += polulat[uu].fitties;

if (fittiesSoFar >= slicing)

return polulat[uu].bit;

}

return "";

}

Related Questions

Navigate

• Browse (All)
• Browse F
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.