Purchase Solution

Matrices: Two-Dimensional Cartesian Structures

Not what you're looking for?

Ask Custom Question

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.

Purchase this Solution
Solution Summary

This solution answers questions regarding data storage in a matrix.

Solution Preview

The structure of a sparse matrix can be defined as follows (using C/C++ syntax)
struct Sparse {
int element; // This is the content of the element
struct Sparse *nextRow; // A pointer to the next row element
struct Sparse *nextCol; // A pointer to the next column element
int row; // The index of row
int column; // The ...

Purchase this Solution
Free BrainMass Quizzes
C# variables and classes

This quiz contains questions about C# classes and variables.

Basic Computer Terms

We use many basic terms like bit, pixel in our usual conversations about computers. Are we aware of what these mean? This little quiz is an attempt towards discovering that.

Basic Networking Questions

This quiz consists of some basic networking questions.

Javscript Basics

Quiz on basics of javascript programming language.

Basic UNIX commands

Use this quiz to check your knowledge of a few common UNIX commands. The quiz covers some of the most essential UNIX commands and their basic usage. If you can pass this quiz then you are clearly on your way to becoming an effective UNIX command line user.

View More Free Quizzes
Related BrainMass Solutions

  • Sparse Matrices, Two-Dimensional Matrices and Lists

    172359 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.

  • Matrix Multiplication Program Using Arrays

    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, four columns /* after declaration

  • Example of Lebesgue Measure and Lebesgue Integration

    Let f be the following function with domain C = [0, 1] X [0, 1] (in two-dimensional Cartesian space): f(x, y) = 0 on the line segments x = 0, y = 0, and x = y f(x, y) = -1/(x^2) if 0 < y < x <= 1 f(x, y) = 1/(y^2) if 0 < x < y <= 1 Compute

  • Storing Three-dimensional Homogeneous Arrays

    So, in order to understand how to store a three-dimensional homogenous array into a one-dimensional memory space we need a function that takes in a i value, j value and k value and returns a unique number between [1..D*W*H*] if i, j and k are cartesian

  • C++ program operations on two matrices 3x3

    The two matrices are definedin two dimensional arrays 3x3: int matrixA[3][3] int matrixB[3][3] There are several functions: display() - to display a matrix transpose() - to transpose a matrix add() - to add two matrices subtract() - to subtract

  • Multipliciative groups

    (1) We view matrix groups with respect to their multiplicative structures. Consider the homomorphism det : GLn(k) → k ? .

  • Unitary Matrices

    The two dimensional rotation matrix is defined as: The rotation matrix is: The complex conjugate of R is: And we see that: Thus is unitary And the determinant is: Since this matrix is not

  • Independence, span and rank of matrices

    - the columns of A span R2 or R3; Can span R2; as those columns of A are 2-dimensional. - the rows of A span R3; NO, as there are ONLY two independent vectors which cannot span R3. NOTE: R3 has a dimension 3.

  • Matrices

    144516 Matrices Let B, C, D, E, F and G be the following matrices: 1 3 2 6 3 9 1 -1 0 0 2 3 0 0 2 1 -1 0 0 1 1 1 0 1 2 1 0 0 0 0 -1 -1 0 0 0 3 0 0 0 0 1 1 3 4 4 6 -2 -3 I would welcome an explanation of whether

View More Related Solutions