Effective way of storing two symmetric matrices, Data Structure & Algorithms

Explain an efficient and effective way of storing two symmetric matrices of the same order in the memory.

A n-square matrix array will be symmetric if a[j][k]=a[k][j] for all j and k.

For a symmetric matrix, we need to store elements which are lying on and below the diagonal of the matrix or those on and above the diagonal. Two symmetric matrix of A and B of the same dimension can be stored in an n*(n+1) array C where c[j][k]=a[j][k] when j≥k but c[j][k-1]=b[j][k-1] when j

 

121_Storing_Matrices_in_Memory.png

Posted Date: 7/9/2012 10:01:10 PM | Location : United States







Related Discussions:- Effective way of storing two symmetric matrices, Assignment Help, Ask Question on Effective way of storing two symmetric matrices, Get Answer, Expert's Help, Effective way of storing two symmetric matrices Discussions

Write discussion on Effective way of storing two symmetric matrices
Your posts are moderated
Related Questions
Q. Describe the term array.  How do we represent two-dimensional arrays in memory?  Explain how we calculate the address of an element in a two dimensional array.

Define the terms     i) Key attribute     ii) Value set  Key attribute:  An entity  type  usually  has  an attribute  whose  values  are  distinct  fr

Q. Give the adjacency matrix for the graph drawn below:                                                 Ans: Adjacency matrix for the graph given to us

Objectives The purpose of this project is to give you significant exposure to Binary Search Trees (BST), tree traversals, and recursive code. Background An arbitrary BST i


how to design a cache simulator with 4-way set associative cache

Q. Suggest a method of implementing two stacks in one array such that as long as space is there in an array, you should be capable to add an element in either stack. Using proposed

Comp are two functions n 2    and  2 n  / 4  for distinct values of n.   Determine When s ec on d function b ec om es l a r g er th an f i r st functi

Like general tree, binary trees are implemented through linked lists. A typical node in a Binary tree has a structure as follows struct NODE { struct NODE *leftchild; i

what''s queue ?