This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: COP 3530 Fall 2010 Data structures and Algorithms Assignment 4 Due: Fri Oct 1st, 2010 In this assignment you will make use of your ArrayList and ChainList implemented in previous assignments. Sparse matrices are matrices populated primarily with zeros (lecture 11). When storing and manipulating sparse matrices on a computer, it is beneficial and often necessary to use specialized algorithms and data structures that take advantage of the sparse structure of the matrix. You are required to implement the parseMatrix data structure described as follows. Your sparseMatrix should consist of an arrayList which keeps chains (the following figure) and each chain holds non-zero elements of a row in matrix. You may use your implementation of ArrayList and ChainList. Header files can be downloaded through the link provided in the notes below. A sample signature of sparseMatrix along with a test (main method) is given in the next page (you need to implement the listed methods). - sparseMatrix( const sparseMatrix<T>&); is a copy constructor which must create a deep copy of the given sparseMatrix (with all its internal data structures). - The method read takes inputs from console (cin) and creates a sparse matrix by assigning the right values to the internal structures of this matrix. The input pattern is given in an example through next pages. The sample input, in is downloadable through homework page. through next pages....
View Full Document