FoothillDe Anza Community College District, Programming Foothill De Anza Community Sparse Matrices CS1C Programming Assignment Part A (required) Sparse Matrices
This is going to be a fun assignment. Imagine trying to allocate a 100000 x 100000 matrix of objects on any computer in a resident program (without using disk storage). Can’t be done. But with your knowledge of ArrayLists and LinkedLists, you can create a template that you and your company can use to do just that.
Design a generic class SparseMat
void clear() clears all the rows, effectively setting all values to the defaultVal(but leaves the matrix size unchanged).
void showSubSquare(int start, int size) a display method that will show a square sub-matrix anchored at (start, start) and whose size is size x size. In other words it will show the rows from start to start + size -1 and the columns from start to start + size 1. This is mostly for debugging purposes since we obviously cannot see the entire matrix at once. Here is a sample main() that will test your template. However, this does not prove that you are correctly storing, adding and removing internal nodes as needed. You’ll have to confirm that by stepping through your program carefully. You main should also print the upper left and lower right of the (huge) matrix, so we can peek into it.
// CIS 1C Assignment #2 // Instructor Solution Featuring clone()// client —————————————————–import cs_1c.*;import java.util.*;//——————————————————public class Foothill{ final static int MAT_SIZE = 100000; // ——- main ————– public static void main(String[] args) throws Exception { // 100000 x 100000 filled with 0 int k; SparseMat
