Question

In: Computer Science

// function definitions go into hw08.cpp: // hw08.cpp namespace hw08 { int main(); const int ARRAY_SIZE...


// function definitions go into hw08.cpp:

// hw08.cpp

namespace hw08
{
int main();

const int ARRAY_SIZE = 5;

const int DYNAMIC_SIZE = 15;

const int TIC_TAC_TOE_SIZE = 3;


// function definitions:

//------------------------------------------------------------------------------

int increment_value(int x)
// pass a value, compute a new value by adding 5 to x and return it
{

// ...
x += 5;

// temp, replace when defining function
return x;           // included so that incomplete lab code will compile
}


void increment_pointer(int* p)
// pass a pointer, increment value of p by 1
{


p += 4;

}

void increment_reference(int& r)
// pass a reference, increment value of r by 1
{

r += 1;

}

//------------------------------------------------------------------------------

void print_2darray_subscript(double* (twoDD[])[ARRAY_SIZE], int row,
int col)
// print array using subscripts
{

for (int i = 0; i < row; i++)

{

for (int j = 0; j < col; j++)

{


cout << twoDD[i][j] << " " << endl;

}

}

}
void print_2darray_pointer(double* twoDD, int row, int col)
/* print array using pointer arithmetic */
{

for (int i = 0; i < row; i++)

{

for (int j = 0; j < col; j++)

{

// our 2d array is layed out linearly in memory as contiguous rows, one after another, there are #row rows
// each row has #col columns

// to compute the offset using pointer math
// offset from twoDD: #row (i) * #col + #col (j), result: pointer to array element
// ...

cout << *((twoDD + i * col) + j) << " ";

}

}

}

int main()
{

// console header
cout << endl;

  
// complete the following pointer examples
// indicate if the requested operation is not allowed, why not?
// Q#1 - pointer examples
int x = 10;

// ... // [1.1] variable p of type pointer to int points to x (i.e. int* p = ?;), use & to get the address of x
int* p = &x;

// ... // [1.2] variable q of type pointer to double is points to x
//error :cannot assign an int pointer to a type double // [1.2] variable q of type pointer to double is points to x
// ... // [1.3] update the value of p to 5, use * to assign to x through p
*p = 5;


// ... // [1.4] store the value of p in variable x2 of type int, use * to read x through p
int x2 = *p;


// ... // [1.5] variable p2 of type pointer to int points to x2, use & to get a pointer to x2
int* p2 = &x2;

// ... // [1.6] assign p to p2, p2 and p both point to x
p = p2;

p = &x2;

// ... // [1.7] point p to x2, what does p2 point to now?
//*p = &x2;

// complete the following reference examples
// indicate if the requested operation is not allowed, why not?
// Q#1 - reference examples
int y = 50;

// ... // [1.8] variable r of type reference to int refers to y (i.e. int& r = ?;), nothing special to do here in the initializer
int& r = y;

// ... // [1.9] variable s of type reference to double refers to y

/* double &s= &y; */

// error : cannot assign an int reference to type double

// ... // [1.10] update the value of r to 10, assign to y through r (notice * is not needed)
r = 10;


// ... // [1.11] store the value of r in variable y2 of type int, read y through r (notice * is not needed)
int y2 = r;

// ... // [1.12] variable r2 of type reference to int refers to y2, get a reference to int y2
int& r2 = y2;

// ... // [1.13] assign r to r2, the value of y is assigned to y2
r2 = r;

y = y2;

// ... // [1.14] assign y2 to r, r2 and r both point to y2

/* r = &y2; */
// error(not allowed) - cannot change the value of a reference

// ... // [1.15] variable r3 of type reference to int is defined but not initialized (i.e. does not refer to an int)

/*int& r3 */
// error(not allowed) -
//Answer : a reference must be initialized when declared

// Q#1 - pointer vs reference: increment functions
// implementation the function definitions for the following increment operations
// allows definition of variables within block scope avoiding redefinition errors
int& r3(int x, int x2, int r);

{

int x = 100;

int x2 = 25;

int* p = &x2;

int& r = x;


cout << "increment pointer vs reference" << endl << endl;


cout << x << endl;

cout << hw08::increment_value(x) << endl;   // x not changed when passed by value
cout << x << endl;


cout << x2 << endl;

hw08::increment_pointer(p);   // p points to x2, x2 updated
cout << x2 << endl;


cout << x << endl;

hw08::increment_reference(r);   // r refers to x, x updated
cout << x << endl;

}

// print 2ddoubles via pointer arithmetic
print_2darray_pointer((double*)twoDDoubles, ARRAY_SIZE, ARRAY_SIZE);

//print 2ddoubles via pointer arithmetic
print_2darray_pointer((double*)twoDDoubles, hw08::ARRAY_SIZE,
hw08::ARRAY_SIZE);

// complete the following dynamic allocation examples
/* q#4 - new, delete operator examples */
{

int* pi = new int;   // [4.1] allocate one int
int* qi = new int[5];   // [4.2] allocate five ints (an array of 5 ints)
int& ri = *pi;

int& ri2 = *qi;

int*& ri3 = qi;

ri = 100;

ri2 = 200;


double* pd = new double;   // [4.3] allocate one double
double* qd = new double[hw08::DYNAMIC_SIZE];   // [4.4] allocate DYNAMIC_SIZE doubles (an array of DYNAMIC_SIZE doubles)

//pi = pd; // [4.5] pi points to pd
// ... error explain : cannot assign a double pointer to a type int
//pd = pi; // [4.6] pd points to pi
// ... error explain : cannot assign an int pointer to a type double

double x = *pd;       // read the (first) object pointed to by pd
double y = qd[5];       // read the sixth object pointed to by qd
double z = *(qd + 10);   // read the tenth object pointed to by qd

delete pd;

delete[]qd;


cout << endl << "ri, ri2, ri3 before delete" << endl << endl;


cout << ri << endl;   // ri refers to *pi
cout << ri2 << endl;   // ri2 refers to *qi
cout << ri3 << endl;   // ri3 refers to qi

delete pi;       // [4.7] how are the values of ri, ri2, ri3 affected by delete statement?
delete[]ri3;       // [4.8] how are the values of ri, ri2, ri3 affected by delete statement?

cout << endl << "ri, ri2, ri3 after delete" << endl << endl;


cout << ri << endl;

cout << ri2 << endl;

cout << ri3 << endl << endl;

}

double* array_of_doubles = hw08::dynamic_allocation_array_doubles(1000);

// use array_of_doubles here
// ... // [4.9] free array, no longer needed
delete[] array_of_doubles;


// Q#5 - dynamic 2d arrays, indexing via subscript operator, pointer arithmetic

// tic tac toe board is an array of int pointers
// each int pointer in the board points to a row


// declare a pointer to an array of int pointers (i.e. a pointer to a pointer of type int)
int** p_p_tictactoe = new int* [TIC_TAC_TOE_SIZE];


// ... // [5.1] row1: dynamically allocate int[TIC_TAC_TOE_SIZE], use initializer list to init to {1,0,0}

p_p_tictactoe[0] = new int[TIC_TAC_TOE_SIZE]
{1, 0, 0 };


// ... // [5.2] row2: dynamically allocate int[TIC_TAC_TOE_SIZE], use initializer list to init to {0,1,0}

p_p_tictactoe[1] = new int[TIC_TAC_TOE_SIZE]
{0, 1, 0 };

// ... // [5.3] row3: dynamically allocate int[TIC_TAC_TOE_SIZE], use initializer list to init to {0,0,1}
p_p_tictactoe[2] = new int[TIC_TAC_TOE_SIZE]
{0, 0, 1 };


// print 2dints via subscript operator
print_2darray_dynamic_subscript(p_p_tictactoe,TIC_TAC_TOE_SIZE,TIC_TAC_TOE_SIZE);

/* print 2dints via pointer arithmetic */

print_2darray_dynamic_pointer(p_p_tictactoe, TIC_TAC_TOE_SIZE,TIC_TAC_TOE_SIZE);


// clean up board, go in reverse order of declaration

// [5.4] delete individual rows (i.e. rows are int arrays, use delete []);;
for (int i = 0; i < DYNAMIC_SIZE; i++)


{


delete[]p_p_tictactoe[i];


}
// [5.5] delete board (board is an array of int pointers, use delete [])
// ...
delete[]p_p_tictactoe;


return 0;

}

};
I have problem in question 5

Solutions

Expert Solution

Working code implemented in C++ and appropriate comments provided for better understanding:

Source code for hw08.cpp:

// hw08.cpp
// to illustrate pointers, pointer arithmetic & dynamic memory

/*************************************************************************
* AUTHOR : First Last
* HW08 : pointers, pointer arithmetic & dynamic memory
* CLASS : CS 1C
* SECTION : Date & Time
*************************************************************************/

#include <iostream>

using namespace std;

// function definitions go into hw08.cpp:

// hw08.cpp

namespace hw08 {

const int ARRAY_SIZE = 5;
const int DYNAMIC_SIZE = 15;
const int TIC_TAC_TOE_SIZE = 3;

// function definitions:

//------------------------------------------------------------------------------

int increment_value(int x)
// pass a value, compute a new value by adding 5 to x and return it
{
return x + 5; // included so that incomplete lab code will compile
}

void increment_pointer(int* p)
// pass a pointer, increment value of p by 1
{
*p++;
}

void increment_reference(int& r)
// pass a reference, increment value of r by 1
{
r++;
}

//------------------------------------------------------------------------------

void print_2darray_subscript(double twoDD[][ARRAY_SIZE], int row, int col)
// print array using subscripts
{
for(int i=0;i<row;i++)
{
for(int j=0; j<col; j++) cout << twoDD[i][j] << " ";
cout << endl;
}
cout << endl;
}

void print_2darray_pointer(double* twoDD, int row, int col)
// print array using pointer arithmetic
{
for (int i = 0; i < row; ++i)
{
double *p = &twoDD [i * col]; // pointer to first row and multiplier for column (necessary since static array) //
for (int j = 0; j < col; ++j)
{
cout << *p << " ";
p++;
}
cout << endl;
}
}

//------------------------------------------------------------------------------

void print_2darray_dynamic_subscript(int** twoDD, int row, int col)
// print array using subscripts
{
for(int i=0;i<row;i++)
{
for(int j=0; j<col; j++) cout << twoDD[i][j] << " ";
cout << endl;
}
cout << endl;
}

void print_2darray_dynamic_pointer(int** twoDD, int row, int col)
// print array using pointer arithmetic
{
for (int i = 0; i < row; ++i)
{
int *p = twoDD [i]; // pointer to first row //
for (int j = 0; j < col; ++j)
{
cout << *p << " "; // print out entry that iterator/pointer is on //
p++; // increment pointer to traverse from column to column, aka traverse row //
}
cout << endl;
}
}

//------------------------------------------------------------------------------

double* dynamic_allocation_array_doubles(int array_size)
// the caller is responsible for the memory allocated
{
int* pi_array = new int[DYNAMIC_SIZE];
// function uses pi_array
// function responsible for cleaning up (i.e. deleting) memory allocated for pi_array
// do stuff here with pi_array
double* pd_array = new double[array_size];
// ... // dynamic memory allocated for pi_array not needed any longer, free it
delete [] pi_array;
return pd_array;
}

//------------------------------------------------------------------------------

} // hw08

//------------------------------------------------------------------------------

int main()
{
// console header
   cout << endl;
   cout << "************************************** " << endl;
   cout << "* Running HW08 * " << endl;
   cout << "* Programmed by William Duong * " << endl;
   cout << "* CS1C: 6/27/2019, 12:33 * " << endl;
   cout << "************************************** " << endl;
   cout << endl;

   // complete the following pointer examples
// indicate if the requested operation is not allowed, why not?
   // Q#1 - pointer examples
int x = 10;
// ... // [1.1] variable p of type pointer to int points to x (i.e. int* p = ?;), use & to get the address of x
int *p = &x;
// ... // [1.2] variable q of type pointer to double is points to x
// double *q = &x; THIS IS NOT ALLOWED DUE TO TYPE SAFETY
// ... // [1.3] update the value of p to 5, use * to assign to x through p
*p = 5;
// ... // [1.4] store the value of p in variable x2 of type int, use * to read x through p
int x2 = *p;
// ... // [1.5] variable p2 of type pointer to int points to x2, use & to get a pointer to x2
int *p2 = &x2;
// ... // [1.6] assign p to p2, p2 and p both point to x
p2 = p;
// ... // [1.7] point p to x2, what does p2 point to now?
p = &x2;

   // complete the following reference examples
// indicate if the requested operation is not allowed, why not?
   // Q#1 - reference examples
int y = 50;
// ... // [1.8] variable r of type reference to int refers to x (i.e. int& p = ?;), nothing special to do here in the initializer
int &r = y;
// ... // [1.9] variable s of type reference to double is refers to x
// double &s = x; THIS IS NOT VALID DUE TO TYPE SAFETY
// ... // [1.10] update the value of r to 10, assign to y through r (notice * is not needed)
r = 10;
// ... // [1.11] store the value of r in variable y2 of type int, read y through r (notice * is not needed)
int y2 = r;
// ... // [1.12] variable r2 of type reference to int refers to y2, get a reference to int y2
int &r2 = y2;
// ... // [1.13] assign r to r2, the value of y is assigned to y2
r2 = r;
// ... // [1.14] assign y2 to r, r2 and r both point to y2
r = y2;
// ... // [1.15] variable r3 of type reference to int is defined but not initialized (i.e. does not refer to an int)
// int &r3; THIS IS NOT VALID, REFERENCES MUST BE DEFINED WHEN DECLARED

   // Q#1 - pointer vs reference: increment functions
// implementation the function definitions for the following increment operations
{ // allows definition of variables within block scope avoiding redefinition errors
int x = 100;
int x2 = 25;
int* p = &x2;
int& r = x;

cout << "increment pointer vs reference" << endl << endl;

cout << x << endl;
cout << hw08::increment_value(x) << endl; // x not changed when passed by value
cout << x << endl;

cout << x2 << endl;
hw08::increment_pointer(p); // p points to x2, x2 updated
cout << x2 << endl;

cout << x << endl;
hw08::increment_reference(r); // r refers to x, x updated
cout << x << endl;
}

   // complete the following pointer arithmetic examples
// indicate if the requested operation is not allowed, why not?
   // Q#2 - pointer arithmetic
double aDoubles[10];
double aDoubles2[10];
double* pd = &aDoubles[5]; // point to aDoubles[5]
double* pd2 = &aDoubles[7]; // point to aDoubles[7]
double* pd3 = &aDoubles2[7]; // point to aDoubles[7]

*pd = 3;
pd[2] = 4;
pd[-3] = 5;
pd2[5] = 6;

// ... // [2.1] move pd three elements to the right
pd += 3;
// ... // [2.2] move pd six elements to the left
pd -= 6;
pd += 1000; // [2.3] // ... error explain
// THIS RESULTS IN BEING OUT OF RANGE OF THE ARRAY
//double d = *pd;// [2.4] // ... error explain
//cout << d << endl;
*pd = 12.34; // [2.5] // ... error explain
cout << *pd << endl;

// ... // [2.6] compute the number of elements between pd and pd2 by taking the difference between pd2 and pd
//double dif2 = pd + pd2;
// [2.7] // ... error explain
// THIS IS OUT OF RANGE OF THE ORIGINAL ARRAY
double dif3 = pd2 - pd3;
// [2.8] // ... error explain
// PD2 AND PD3 EXIST ON DIFFERENT PARTS OF THE HEAP (I.E. NOT CONTIGUOUS)
cout << dif3 << endl;
// THESE TWO POINTERS CORRELATE TO AREAS IN MEMORY WHICH ARE IN DIFFERENT POINTS OF THE STACK //

cout << endl << "print array of doubles forward and backward" << endl << endl;

// [2.9] print array going forwards
// p starts at address aDoubles[0], ends at address &aDoubles[9], increment p, cout value pointed to by p
//for (double* p = // ... ) cout << // ... << '\n';
{
double *p = aDoubles;

for (p = aDoubles; p < &aDoubles[10]; ++p)
cout << *p << " ";

}

cout << endl;

// [2.10] print array going backwards
// p starts at address aDoubles[9], ends at address &aDoubles[0], decrement p, cout value pointed to by p
//for (double* p = // ... ) cout << // ... << '\n';
{
double *p = &aDoubles [10];

for (p - 1; p >= &aDoubles[0]; --p)
cout << *p << " ";

}
cout << endl;

double* pd4 = &aDoubles[0];
double* pd5 = aDoubles+5;
double* pd6 = &aDoubles[5];
double* pd7 = &aDoubles2[5];
// [2.11] using the equality operator, compare pointers to array elements
//if (// ...) cout << "pointers point to the same element of the array" << endl;
// [2.12] ... error explain
//if (pd6 != pd7) cout << "pointers point to the different elements of the array" << endl;

   // complete the following function implementations
   // Q#3 - pointer arithmetic, indexing multidimensional arrays
double twoDDoubles[hw08::ARRAY_SIZE][hw08::ARRAY_SIZE] = {{1,2,3,4,5},{6,7,8,9,10},{11,12,13,14,15},{16,17,18,19,20},{21,22,23,24,25}};

cout << endl << "print 2d array of doubles" << endl << endl;

// print 2ddoubles via subscript operator
hw08::print_2darray_subscript(twoDDoubles, hw08::ARRAY_SIZE, hw08::ARRAY_SIZE);
// print 2ddoubles via pointer arithmetic
hw08::print_2darray_pointer((double*)twoDDoubles, hw08::ARRAY_SIZE, hw08::ARRAY_SIZE);

   // complete the following dynamic allocation examples
   // Q#4 - new, delete operator examples
{
int* pi = new int; // [4.1] allocate one int
int* qi = new int[5]; // [4.2] allocate five ints (an array of 5 ints)
int& ri = *pi;
int& ri2 = *qi;
int*& ri3 = qi;
ri = 100;
ri2 = 200;

double* pd = new double (2.1); // [4.3] allocate one double
double* qd = new double[hw08::DYNAMIC_SIZE]; // [4.4] allocate DYNAMIC_SIZE doubles (an array of DYNAMIC_SIZE doubles)

//pi = pd; // [4.5] pi points to pd
// PI = POINTER OF TYPE INT CANNOT BE ASSIGNED PD (POINTER OF TYPE DOUBLE)
//pd = pi; // [4.6] pd points to pi
// TYPE SAFETY PREVENTS POINTERS OF DIFFERENT TYPES FROM BEING ASSIGNED TO EACH OTHER

double x = *pd; // read the (first) object pointed to by pd
double y = qd[5]; // read the sixth object pointed to by qd
double z = *(qd+10); // read the tenth object pointed to by qd

//cout << x << " " << y << " " << z << endl;

delete pd;
delete [] qd;

cout << endl << "ri, ri2, ri3 before delete" << endl << endl;

cout << ri << endl; // ri refers to *pi
cout << ri2 << endl; // ri2 refers to *qi
cout << ri3 << endl; // ri3 refers to qi

delete pi; // [4.7] how are the values of ri, ri2, ri3 affected by delete statement?
delete [] ri3; // [4.8] how are the values of ri, ri2, ri3 affected by delete statement?

cout << endl << "ri, ri2, ri3 after delete" << endl << endl;

cout << ri << endl;
cout << ri2 << endl;
cout << ri3 << endl << endl;
}

double* array_of_doubles = hw08::dynamic_allocation_array_doubles(1000);
// use array_of_doubles here
// ... // [4.9] free array, no longer needed
delete [] array_of_doubles;

   // Q#5 - dynamic 2d arrays, indexing via subscript operator, pointer arithmetic

// tic tac toe board is an array of int pointers
// each int pointer in the board points to a row

// declare a pointer to an array of int pointers (i.e. a pointer to a pointer of type int)
int** p_p_tictactoe = new int*[hw08::TIC_TAC_TOE_SIZE];
// ... // [5.1] row1: dynamically allocate int[TIC_TAC_TOE_SIZE], use initializer list to init to {1,0,0}
p_p_tictactoe [0] = new int [hw08::TIC_TAC_TOE_SIZE] {1, 0, 0};
// ... // [5.2] row2: dynamically allocate int[TIC_TAC_TOE_SIZE], use initializer list to init to {0,1,0}
p_p_tictactoe [1] = new int [hw08::TIC_TAC_TOE_SIZE] {0, 1, 0};
// ... // [5.3] row3: dynamically allocate int[TIC_TAC_TOE_SIZE], use initializer list to init to {0,0,1}
p_p_tictactoe [2] = new int [hw08::TIC_TAC_TOE_SIZE] {0, 0, 1};

// print 2dints via subscript operator
hw08::print_2darray_dynamic_subscript(p_p_tictactoe, hw08::TIC_TAC_TOE_SIZE, hw08::TIC_TAC_TOE_SIZE);
// print 2dints via pointer arithmetic
hw08::print_2darray_dynamic_pointer(p_p_tictactoe, hw08::TIC_TAC_TOE_SIZE, hw08::TIC_TAC_TOE_SIZE);

// clean up board, go in reverse order of declaration

// [5.4] delete individual rows (i.e. rows are int arrays, use delete [])
for (int i = 0; i < hw08::TIC_TAC_TOE_SIZE; ++i)
delete [] p_p_tictactoe [i]; // DE-ALLOCATES ARRAY ROW TO ROW //
// [5.5] delete board (board is an array of int pointers, use delete [])
delete [] p_p_tictactoe;

return 0;
}

//------------------------------------------------------------------------------
// WRITTEN ANSWERS

// [1.9] variable s of type reference to double is refers to x
// double &s = x; THIS IS NOT VALID DUE TO TYPE SAFETY

// [1.15] variable r3 of type reference to int is defined but not initialized (i.e. does not refer to an int)
// int &r3; THIS IS NOT VALID, REFERENCES MUST BE DEFINED WHEN DECLARED

// [2.3] // ... error explain (pd += 1000;)
// THIS RESULTS IN BEING OUT OF RANGE OF THE ARRAY

// [2.4] // ... error explain (double d = *pd;)
// POINTER CURRENTLY OUT OF RANGE //

// [2.5] // ... error explain (*pd = 12.34;)
// POINTER CURRENTLY OUT OF RANGE //

// [2.7] // ... error explain (double dif2 = pd + pd2;)
// THIS IS OUT OF RANGE OF THE ORIGINAL ARRAY

// [2.8] // ... error explain (double dif3 = pd2 - pd3;)
// PD2 AND PD3 EXIST ON DIFFERENT PARTS OF THE HEAP (I.E. NOT CONTIGUOUS)

// [2.9] // ... error explain (dif3)
// THESE TWO POINTERS CORRELATE TO AREAS IN MEMORY WHICH ARE IN DIFFERENT POINTS OF THE STACK //

// [4.5] pi points to pd ... error explain (pi = pd;)
// PI = POINTER OF TYPE INT CANNOT BE ASSIGNED PD (POINTER OF TYPE DOUBLE)

// [4.6] pd points to pi ... error explain (pd = pi;)
// TYPE SAFETY PREVENTS POINTERS OF DIFFERENT TYPES FROM BEING ASSIGNED TO EACH OTHER

Sample Output Screenshots:

Hope it helps, if you like the answer give it a thumbs up. Thank you.


Related Solutions

#include <iostream> #include <fstream> #include <string> using namespace std; const int QUIZSIZE = 10; const int...
#include <iostream> #include <fstream> #include <string> using namespace std; const int QUIZSIZE = 10; const int LABSIZE = 10; const int PROJSIZE = 3; const int EXAMSIZE = 3; float getAverage(float arr[], int size) { float total = 0; for (int i = 0; i < size; i++) { total += arr[i]; } return total/size; } // the following main function do.... int main() { ifstream dataIn; string headingLine; string firstName, lastName; float quiz[QUIZSIZE]; float lab[LABSIZE]; float project[PROJSIZE]; float midExam[EXAMSIZE];...
code from assignment 1 #include #include using namespace std; const int nameLength = 20; const int...
code from assignment 1 #include #include using namespace std; const int nameLength = 20; const int stateLength = 6; const int cityLength = 20; const int streetLength = 30; int custNomber = -1; // Structure struct Customers { long customerNumber; char name[nameLength]; char state[stateLength]; char city[cityLength]; char streetAddress1[streetLength]; char streetAddress2[streetLength]; char isDeleted = 'N'; char newLine = '\n'; int zipCode; }; int main() { ofstream file; file.open("Customers.dat", fstream::binary | fstream::out); char go; long entries = 0; struct Customers data; do...
#include <iostream> using namespace std; const int DECLARED_SIZE = 10; void fillArray(int a[], int size, int&...
#include <iostream> using namespace std; const int DECLARED_SIZE = 10; void fillArray(int a[], int size, int& numberUsed) { cout << "Enter up to " << size << " nonnegative whole numbers.\n" << "Mark the end of the list with a negative number.\n"; int next, index = 0; cin >> next; while ((next >= 0) && (index < size)) { a[index] = next; index++; cin >> next; } numberUsed = index; } int search(const int a[], int numberUsed, int target) {...
Using the following array: //may be declared outside of the main function const int NUM_Games =4;...
Using the following array: //may be declared outside of the main function const int NUM_Games =4; //may only be declared within the main function int scores[NUM_GAMES] = {122, 76, 92, 143}; Write a C++ program to run a menu-driven program with the following choices: 1) Display the scores 2) Change a score 3) Display game with the highest score 4) Display a sorted list of the scores 5) Quit Write a function called getValidScore that allows a user to enter...
#include<iostream> using namespace std; class point{ private: int x; int y; public: void print()const; void setf(int,...
#include<iostream> using namespace std; class point{ private: int x; int y; public: void print()const; void setf(int, int); }; class line{ private: point ps; point pe; public: void print()const; void setf(int, int, int, int); }; class rectangle{ private: line length[2]; line breadth[2]; public: void print()const; void setf(int, int, int, int, int, int, int, int); }; int main(){ rectangle r1; r1.setf(3,4,5,6, 7, 8, 9, 10); r1.print(); system("pause"); return 0; } a. Write function implementation of rectangle, line and point. b. What is...
#include <iostream> using namespace std; int main() {     int hour;     int min;     for (hour = 1;...
#include <iostream> using namespace std; int main() {     int hour;     int min;     for (hour = 1; hour <= 12; hour++)     {         for (min = 0; min <= 59; min++)         {             cout << hour << ":" << min << "AM" << endl;         }     }       return 0; } 1.      Type in the above program as time.cpp. Add a comment to include your name and date. Compile and run. 2.      What is the bug or logic error in the above program? Add the...
#include #include using namespace std; //Implement function lookUpFirstNeg() here int main() { double *dd, *ddAns; //allocate...
#include #include using namespace std; //Implement function lookUpFirstNeg() here int main() { double *dd, *ddAns; //allocate memory for at least 3 double elements //ensure all elements have been initialized //call function, replace 0 with the proper number of elements pointed to by dd ddAns = lookUpFirstNeg(dd, 0); if(ddAns == NULL) cout << "No negatives found.\n"; else cout << "First negative value is:" << ddAns << endl; //properly deallocate memory allocated above return 0; }
#include <iostream> #include <iomanip> using namespace std; int main() {     int studentid, numberreverse[20], count =...
#include <iostream> #include <iomanip> using namespace std; int main() {     int studentid, numberreverse[20], count = 0, maximum = 0, minimum = 0;     cout << "Enter your student ID number: ";     cin >> studentid;     cout << "Student ID Number = " << studentid << endl;     while (studentid != 0)     {          numberreverse[count] = studentid % 10;          if (count == 0)          {              minimum = numberreverse[count];              maximum = minimum;          }          else...
Create a Visual Studio console project (c++) containing a main() program that declares a const int...
Create a Visual Studio console project (c++) containing a main() program that declares a const int NUM_VALUES denoting the array size. Then declare an int array with NUM_VALUES entries. Using a for loop, prompt for the values that are stored in the array as follows: "Enter NUM_VALUES integers separated by blanks:" , where NUM_VALUES is replaced with the array size. Then use another for loop to print the array entries in reverse order separated by blanks on a single line...
I need a Flowgorithm chart of this #include using namespace std; int main() {    float...
I need a Flowgorithm chart of this #include using namespace std; int main() {    float CISBook[] = {55.5,35.8,67.5};    float MATHBook[] = {25.5, 54.5};    float MECBook[] = {65.0,75.5,86.8};    float sumCIS=0, sumMATH = 0, sumMEC = 0;              for (int i=0; i<4; i++)    {sumCIS += CISBook[i];}       for (int i=0; i<3; i++)    {sumMATH += MATHBook[i];}       for (int i=0; i<4; i++)    {sumMEC += MECBook[i];}       cout<<"\nTotal for CIS Books:...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT