Question

IN C++ Please!! Declare a global integer constant called SIZE and initialize it to 10. • Declare a global enum variable that will support 10 values – each representing an ant colony {A, B, C, D, E, F, G, H, I, J}. • In the main function, o Declare a 2-dimensional array of size the global integer constant, SIZE. The number of rows and columns should be equal to SIZE, which would make this a square matrix. This array will hold the pheromone levels between adjacent ant colonies. o Declare a 1-dimensional array of size the global integer constant, SIZE that will hold the colonies visited in the order in which they were visited. This array will hold the row indices from the 2-dimensional array. If Anthony visits a colony, store the integral value of that colony (0 for A, 1 for B, 2 for C and so on) in the 1-dimensional array. For example, if Anthony visits index A first, the first element in the 1-dimensional array would be 0. If Anthony visits colony C next, the second element in the array would be 2 and so on. • Declare and define a function to initialize the 2-dimensional int array declared in the main function such that: o It accepts a two-dimensional int array as a parameter. o It doesn’t return a value. o Within this function, generate seeded random numbers between 1 and 20 (inclusive) and assign these values in a row-major format (i.e., fill an entire row with random values before moving to the next row). Do this as long as the row and column number are not equal. If they are equal, assign a value of 0 to that node (because we assume that there is no path from an ant colony to itself). o You should end up with a matrix where the diagonal elements are 0. Please see the sample output. • Declare and define a function to print the contents of the two-dimensional array generated in the previous step. o It should take the previously generated two-dimensional int array as its parameter. o It should not return a value. o Please see the sample output for the format of the output. • Declare and define a function that checks if a particular colony was visited before. o It takes two parameters: the 1-dimensional array that holds the colonies visited and an integer that represents a colony. o It returns a boolean value; true if the colony (represented by the integer) was visited before or false otherwise. o To determine if a colony has been visited before, you will have to iterate over all the values in the 1-dimensional array (that holds all colonies previously visited by Anthony) and check to see if the integer parameter is present in it. • Declare and define a function that computes the index where the lowest (non-zero) pheromone levels are found in a given row. o It takes three parameters; the 2-dimensional array declared in the main function that contains all the pheromone levels, the 1-dimensional array that contains the list of all the colonies that were visited and an integer that represents a row in the 2-dimensional array. o For each of the columns in a row, compute the lowest non-zero value only if that colony wasn’t visited before. To check if a colony was visited before, you must call the function defined in the previous step. o For example, in the sample output, when Anthony first starts his journey at colony A, he has to find the path with lowest, non-zero pheromone levels in that row (row 0), which is 4 at column 6 that represents colony G. Anthony then travels from colony A to colony G. • Declare and define a function that prints the contents the array that holds the colonies visited. o This function will take the 1-dimensional array as a parameter. o It will not return a value. o Using a loop of your choice, process each element stored in the 1-dimensional array like so: ▪ Use a switch statement and each of the enum values as case constants, print the path that Anthony took between the ant colonies. For example, for case A, print “A - - - - ->”. Do this for the rest of the cases. Keep in mind, index 0 means colony ‘A’, index 1 is colony ‘B’ and so on until colony ‘J’. ▪ Please make sure that your output is well formatted. You may use the printf instruction with space formatting to ensure that all elements of the matrix are aligned (like the sample output). Additionally, use the precision format specifier in the printf statement to ensure that each integer is represented using two digits. • Inside your main function you will need to: o Call the function that prints the student information. o Call the function that prints a brief description of what his project aims to do. o Call the function that initializes the 2-dimensional array with random numbers. Don’t forget to provide the 2-dimensional array as a parameter to this function. o Call the function that prints the contents of the 2-dimensional array. Again, don’t forget to provide the 2-dimensional array as a parameter during this function call. o Anthony always starts his journey from colony ‘A’. So, mark this colony as visited. o Starting with colony A, he must travel to the colony with the lowest non-zero pheromone levels, provided that it wasn’t visited before. This means that the rows in the array are accessed non-sequentially, but all the columns in a given row are always accessed sequentially to determine the lowest pheromone levels. o Once you obtain the column index where the lowest (non-zero) pheromone level is found in a given row, you must go to the row that is represented by that column index and continue this process. Don’t forget to mark this colony as visited. o To determine the lowest pheromone levels in a given row, call the function that returns the index at which the lowest value is found. Don’t forget to provide the 2-dimensional array, the 1- dimensional array and the row currently being accessed as parameters to this function. o If the colony with the lowest pheromone levels was visited before, disregard that colony and proceed to the colony with the next lowest pheromone levels. o If the pheromone levels between two or more colonies is equal, you are free to arbitrarily choose one of those colonies, provided of course that colony hasn’t been visited before. o Anthony can only visit a colony once. Once a colony is visited, Anthony cannot return to it. So, keep track of the colonies visited. So, make sure that all values in the 1-dimensional array are unique. o He must visit each of the 10 colonies (A through J). o If Anthony visits a colony, store the integral value of that colony (0 for A, 1 for B, 2 for C and so on) in the 1-dimensional array. For example, if Anthony visits index A first, the first element in the 1-dimensional array would be 0. If Anthony visits colony C next, the second element in the array would be 2 and so on. o In addition to the colonies visited, you must also keep track of the order in which they were visited. • Finally, display the path that Anthony took starting from colony A using the function that prints the contents of the 1-dimensional array. • Your code should be well documented in terms of comments. For example, good comments in general consist of a header (with your name, course section, date, and brief description), comments for each variable, commented blocks of code, and function header comments. • Your program source code should be named “euidHW3.cpp”, without the quotes. • Your program will be graded based largely on whether it works correctly on the CSE machines (e.g., cse01, cse02, …, cse06), so you should make sure that your program compiles and runs on a CSE machine. • You should contact your instructor if there is any question about what is being asked for. You may assume that all input will be of the appropriate data type, although the range (e.g., an integer) may be out of bounds of the region. Please pay attention to the SAMPLE OUTPUT for specific details about the flow and input/output of the program. You shall use techniques and concepts discussed in class – you are not to use global variables (other than SIZE and enum), goto statements, or other items specifically not recommended in this class.

Answer 1

#include<iostream>               //For basic I/O
#include<stdlib.h>               //For rand() and srand() functions
#define SIZE 10
using namespace std;

enum E{A, B, C, D, E, F, G, H, I, J};

void initialize(int arr[][SIZE])
{
   for(int i = 0;i<SIZE;i++)
       for(int j=0;j<SIZE;j++)
       {
           if(i==j)
           {
               arr[i][j] = 0;
               continue;
           }
           srand(rand()%100+1000+i+j+rand());
           arr[i][j] = rand()%20 + 1;
           srand(i+j);
       }
}

void print(int arr[][SIZE])
{
   cout<<endl;
   for(int i=0;i<SIZE;i++)
   {
       for(int j=0;j<SIZE;j++)
       {
           cout<<arr[i][j]<<"\t";
       }
       cout<<endl;
   }
}

bool isVisited(int *arr, int val)
{
   for(int i=0;i<SIZE;i++)
       if(arr[i]==val)
           return true;
   return false;
}

int lowestpheromoneindex(int arr1[][10],int *arr2, int row)
{
   int min=arr1[row][0];
   int index = 0;
   if(!isVisited(arr2,row))
   {
       for(int i = 1;i<SIZE;i++)
       {
           if(i!=row)
               if(arr1[row][i]<min)
               {
                   min = arr1[row][i];
                   index = i;
               }
       }
       return index;
   }
   return -1;
}

void displayVisited(int *arr)
{
   int temp;
   for(int i=0;i<SIZE;i++)
   {
       temp = arr[i];
       switch(temp)
       {
           case A: cout<<"A ----->";
               break;
           case B: cout<<"B ----->";
               break;
           case C: cout<<"C ----->";
               break;
           case D: cout<<"D ----->";
               break;
           case E: cout<<"E ----->";
               break;
           case F: cout<<"F ----->";
               break;
           case G: cout<<"G ----->";
               break;
           case H: cout<<"H ----->";
               break;
           case I: cout<<"I ----->";
               break;
           case J: cout<<"J ----->";
               break;
       }
   }
}

int main()
{
   int arr[SIZE][SIZE];
   int visited[SIZE];
   //printStudentInformation();
   //printDescription();
   initialize(arr);
   print(arr);
   visited[0] = 0;
   int i = 1;
   int minIndex = 0;
   while(i<10)
   {
       minIndex = lowestpheromoneindex(arr,visited,minIndex);
       if(!isVisited(visited,minIndex))
       {
           visited[i] = minIndex;
           i++;
       }

   }
   displayVisited(visited);
   return 0;
}

//According to the question solution is designed.

#Note: There is some discrepency in the question with that it may go to infinite loop if rand() is not generating uniqely. Consult you instructor for that.

#Please leave your rating. Hope you like it! Ask doubts if any in the comments section.