Question

Wondering if I could get some guidance on setting up newMatrix(). Language is C

Matrix ADT Specifications In addition to the main program Sparse.c and the altered List.c from pal, you will implement a Matrix ADT in a file called Matrix.c. This ADT will contain a private inner struct (similar to Node in your List ADT) encapsulating the column and value information corresponding to a matrix entry. You can give this inner struct any name you wish, but I will refer to it here as Entry. Thus Entry is a pointer to a struct called EntryObj that has two fields storing types int and double respectively. Your Matrix ADT will represent a matrix as an array of Lists of Entries. Since Entry is itself a pointer, it can be assigned to a field of type void*. It is required that each List of Entries be maintained in column sorted order. Your Matrix ADT will export the following operations. // newMatrix() // Returns a reference to a new nxn Matrix object in the zero state. | Matrix newMatrix(int n) // freeMatrix () // Frees heap memory associated with *pm, sets *pM to NULL. void freeMatrix (Matrix* PM); // Access functions // size () // Return the size of square Matrix M. int size (Matrix M); // NNZ () // Return the number of non-zero elements in M. int NNZ (Matrix M); // equals() // Return true (1) if matrices A and B are equal, false (0) otherwise. int equals (Matrix A, Matrix B);

Answer 1

#include <iostream> #include "Matrix.h" using namespace std; int main() {    Matrix *M = nullptr;    M = M->newMatrix(5);    Matrix *N = nullptr;    N = N->newMatrix(10);    cout << M->equals(*M, *N);    M->printMatrix();    N->printMatrix();       cout << "Zeros: " << N->NNZ(*N) << endl;    cout << "Size: " << N->size(*N) << endl;       /*N->freeMatrix(N);    N->printMatrix();*/    return 0; }

#pragma once #include <iostream> using namespace std; struct Entry {    int size;    double **Arr2; }; class Matrix { private:    Entry *EntryObj; public:    Matrix()    {        EntryObj = new Entry();    }    Matrix *newMatrix(int n)    {        Matrix *ret = new Matrix();        ret->EntryObj->size = n;        ret->EntryObj->Arr2 = new double*[n];        for (int i = 0; i < n; i++)        {            ret->EntryObj->Arr2[i] = new double[n];        }        for (int i = 0; i < n; i++)        {            for (int j = 0; j < n; j++)            {                ret->EntryObj->Arr2[i][j] = 0;            }        }        return ret;    }    void freeMatrix(Matrix *M)    {        M->~Matrix();    }    int size(Matrix M)    {        return EntryObj->size;    }    int NNZ(Matrix M)    {        int count = 0;        for (int i = 0; i < M.EntryObj->size; i++)        {            for (int j = 0; j < M.EntryObj->size; j++)            {                if (M.EntryObj->Arr2[i][j] == 0)                    count++;            }        }        return count;    }    int equals(Matrix A, Matrix B)    {        if (A.EntryObj->size == B.EntryObj->size)        {            for (int i = 0; i < A.EntryObj->size; i++)            {                for (int j = 0; j < A.EntryObj->size; j++)                {                    if (A.EntryObj->Arr2[i][j] != B.EntryObj->Arr2[i][j])                        return 0;                }            }        }        else return 0;        return 1;    }    void printMatrix()    {        cout << endl;        for (int i = 0; i < EntryObj->size; i++)        {            for (int j = 0; j < EntryObj->size; j++)            {                cout << EntryObj->Arr2[i][j] << " ";            }            cout << endl;        }        cout << endl;    }    ~Matrix()    {        EntryObj = nullptr;    } };

8 8 8 8 9 8 8 8 8 9 ග ග ග ග ග ග ග ග ග 9 9 9 0 8 9 Zeros: 100 Size: 10 Press any key to continue ...

IF THERE IS ANY PROBLEM OR YOU HAVE ANY QUERY REGARDING THE SOLUTION KINDLY FEEL FREE TO ASK, AND LEAVE A THUMBS UP WHEN YOU ARE SATISFIED. THANKS!.