IrmaMoves.h (C code): #include \"IrmaMoves.h\" typedef struct Move { Irma irma;

Question

IrmaMoves.h (C code):

#include "IrmaMoves.h"

typedef struct Move {

Irma irma;            // an instance of Irma

L Location from_loc; // location where Irma is moving from

Location current_loc; // location where Irma is passing over

Location to_loc; // location where Irma is moving to

} Move;

typedef struct Location {

char col; // the square's column ('a' through 'h')

int row; // the square's row (0 through 7)

} Location;

typedef struct Irma {

int ws; // wind speed (MPH)

int wg; // wind gusts (MPH)

} Irma;

-el|IrmaMoves.pdf 0 file:///C/Users Chris/ AppData/Local/Temp /Ter pl project% 201-1.2 pirmal loves.pdf chardestroyMapBoard icharoard) Description: Free all dynamically allocated memory associated with board. You may assume this function receives a dynamically allocated 2D char array with dimensions 8x8. Output: This function should not print anything to the screen. Return Value: This function must retun HuLL. void printMapBoard (char board) Description (and Output): This function takes a pointer to an 8x8 char array and prints the map board represented by that array using the format described below. This format is also shown explicitly in several of the test case output files included with this assignment. The printout of the map board should be preceded by a line of eight equal symbols(-). and it should also be followed by a line of eight-symbols, followed by a blank line. For example: CC D C DD - Note: This 1s a completely blank 11ne. (No spaces Do more with Microsoft Edge - the fast, new browser built for Windows 10. Change my default Don't ask again 2:27 PM Type here to search ^4x 9/22/2018

Explanation / Answer

// C++ program to illustrate dynamic allocation

// and deallocation of memory using new and delete

#include <iostream>

using namespace std;

  

int main ()

{

    // Pointer initialization to null

    int* p = NULL;

  

    // Request memory for the variable

    // using new operator

    p = new int;

    if (!p)

        cout << "allocation of memory failed ";

    else

    {

        // Store value at allocated address

        *p = 29;

        cout << "Value of p: " << *p << endl;

    }

  

    // Request block of memory

    // using new operator

    float *r = new float(75.25);

  

    cout << "Value of r: " << *r << endl;

  

    // Request block of memory of size n

    int n = 5;

    int *q = new int[n];

  

    if (!q)

        cout << "allocation of memory failed ";

    else

    {

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

            q[i] = i+1;

  

        cout << "Value store in block of memory: ";

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

            cout << q[i] << " ";

    }

  

    // freed the allocated memory

    delete p;

    delete r;

  

    // freed the block of allocated memory

    delete[] q;

  

    return 0;

}

// C++ program to illustrate dynamic allocation

// and deallocation of memory using new and delete

#include <iostream>

using namespace std;

  

int main ()

{

    // Pointer initialization to null

    int* p = NULL;

  

    // Request memory for the variable

    // using new operator

    p = new int;

    if (!p)

        cout << "allocation of memory failed ";

    else

    {

        // Store value at allocated address

        *p = 29;

        cout << "Value of p: " << *p << endl;

    }

  

    // Request block of memory

    // using new operator

    float *r = new float(75.25);

  

    cout << "Value of r: " << *r << endl;

  

    // Request block of memory of size n

    int n = 5;

    int *q = new int[n];

  

    if (!q)

        cout << "allocation of memory failed ";

    else

    {

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

            q[i] = i+1;

  

        cout << "Value store in block of memory: ";

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

            cout << q[i] << " ";

    }

  

    // freed the allocated memory

    delete p;

    delete r;

  

    // freed the block of allocated memory

    delete[] q;

  

    return 0;

}

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

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