Question

C++ Program To demonstrate ability to write sparse matrix operations.

Write a C++ class to create 2D sparse matrices, sum them, and transpose them. You don't have to use operator overloading in this program. Each matrix should be shown in sparse format (which shown only non-zero items). This program will be a command line-based program. Do not interact with user with a menu. Instead, user will use "command language" (aka command entry) as detailed below. Your program will keep at most five matrices. You should be able to interpret string commands correctly. The command interpreter includes these statements:

  
- X -- print out matrix in sparse form
- X(a,b) = I   -- assigns I to X(a,b)
- matrix X(m,n) -- create a new matrix X with size (m,n)
- X = Y + Z -- sums Y and Z and assigns it to newly created or existing matrix X.
- X = T(Y) -- transposes Y and assigns it to newly created or existing matrix X. - exit exits the program

An example run is given below. The command with background shows user's entry.

>Matrix.exe↩
>>matrix A(4,7)↩
>>A(2,4) = 9↩
>>A↩
2:4 9
>>A(1,5) = 3↩
>>matrix B(4,7)↩
>>B(2,4) = -9↩
>>B(3,3) = 5↩
>>B↩
2:4 -9, 3:3 5
>>A↩
1:5 3, 2:4 9
>> C = A + B↩
>> C↩
1:5 3, 3:3 5
>> D = T(C)↩
>> D↩
3:3 5, 5:1 3
>> exit↩

Answer 1

1. #include<iostream>

2. using namespace std;

3. int main ()

4. {

5.     int A[10][10], i, j, m, n, count = 0;

6.     cout << "Enter number of rows and columns : ";

7.     cin >> m >> n;

8.     cout << "Enter array elements : ";

9.     for (i = 0; i < m; i++)

10.     {

11.         for (j = 0; j < n; j++)

12.         {

13.             cin >> A[i][j];

14.             if (A[i][j] == 0)

15.                 count++;

16.         }

17.     }

18.     if (count > ((m * n) / 2))

19.         cout << "The matrix is a sparse matrix.\n ";

20.         else

21.         cout << "The given matrix is not a sparse matrix.\n ";

22.     for (i = 0; i < m; i++)

23.     {

24.         for (j = 0; j < n; j++)      

25.             cout << A[i][j] << " ";

26.         cout << "\n ";

27.     }

28.     return 0;

29. }