Sparse Matrices, Two-Dimensional Matrices and Lists
One of the problems of storing data in a matrix (a two-dimensional Cartesian structure) is that if not all of the elements are used, there might be quite a waste of space. In order to handle this, we can use a construct called a "sparse matrix", where only the active elements appear. Each such element is accompanied by its two indexes (the row and the column). Discuss in what ways such a structure is similar to and/or different than a list.
Solution Summary
This solution describes the advantages of using sparse matrices over two-dimensional matrices, apart from exploring the differences between lists and sparse matrices.
For what value of k does equality hold l 5 2 3 l l 1 2 3 l and l 1 2 4 l l 1 2 4 l
l -10 3 4 l =k l -2 3 4 l ? l 3 6 9 l =k l 3 6 9 l
l-15 4 5 l l -3 4 5 l l 0 5 0 l
Write a C++ program that uses class Matrix for dealing with the square matrices (n x n tables of integers). The class constructor has to create a dynamic nxn matrix for n passed as a parameter. Supply the class with a copy constructor. Two overloaded operators + and * have to be implemented for adding and multiplying two matrice
Q: Find the determinant of these 2x2 matrices.
(a) mat[4 3; -2 9] (b) mat[5 -7; 4 12]
Please see the Word document for a cleaner version of the problem.
Attached are the requirements for the program.
You are going to write a program to multiply two matrices.
The matrices are stored in a two-dimensional array:
int[][] matrixA
int[][] matrixB
Recall:
Here is the way to declare a two-dimensional array:
int testArray[3][4] = {{1,2,3,4},{2,3,4,1},{5,4,3,0}}; // three rows,
Matrices
Multiply: [■(1&2@3&0)][■(1@-1)] =
Multiply: [■(-1&2@3&1)][■(2&4@3&1)] =
Matrix A shows number of stocks holding by William and Michael:
Matrix B shows price in dollars per share:
Find inverse to the given matrix
(see instructions on Blackboard in Course
