Page 98 - DCAP201_FUNDAMENTALS_OF_DATA_STRUCTURES

Unit 6: Operations on Arrays and Sparse Matrices

7. Explain the concept of Compressed Diagonal Storage. Notes
8. Describe the simplified form of JDS with example.
9. Discuss the importance of profile matrices.
10. CDS storage scheme is particularly useful if the matrix arises from a finite element or
finite difference discretisation on a tensor product grid. Comment.

Answers: Self Assessment

1. True 2. False
3. sparse matrices 4. triangular matrix
5. tridiagonal 6. compressed row storage (CRS)

7. Harwell-Boeing 8. Block
9. Jagged Diagonal Storage (JDS) 10. ITPACK
11. non-zeros 12. Profile

13. columns 14. vector
15. 3-tuple

6.6 Further Readings

Books Davidson, 2004, Data Structures (Principles and Fundamentals), Dreamtech Press
Karthikeyan, Fundamentals, Data Structures and Problem Solving, PHI Learning
Pvt. Ltd.
Samir Kumar Bandyopadhyay, 2009, Data Structures using C, Pearson Education
India

Sartaj Sahni, 1976, Fundamentals of Data Structures, Computer Science Press

Online links http://www.c-program-example.com/2012/01/c-program-to-generate-
sparse-matrix.html
http://www.microchip.com/forums/m563069-print.aspx
http://www.c4learn.com/c-programs/c-program-to-implement-stack-
operations-using-array.html
http://www.gnu.org/software/octave/doc/interpreter/Creating-Sparse-
Matrices.html

LOVELY PROFESSIONAL UNIVERSITY 91