Column major representation, Data Structure & Algorithms

Column Major Representation

In memory the second method of representing two-dimensional array is the column major representation. Under this illustration, the first column of the array occupies the first set of the memory locations kept for the array. The second column occupies next set & so forth. The representation of a column major representation is illustrated in Figure

Assume the following two-dimensional array:

1518_Column Major Representation.png

To make its equivalent column major representation, we carry out the following procedure:

Transpose the elements of the array. After that, the representation will be alike as that of the row major representation.

Through application of above denoted process, we get {a, e, i, b, f, j, c, g, k, d, h, i}

Col 0

Col 1

Col 2

.....

Col i

 

 

Figure: Schematic of Column major representation of an Array

1) In which array can be stored?

2) In which, the elements of array are stored row wise.

3) In which, the elements of array are stored column wise.

 

Posted Date: 4/4/2013 6:48:27 AM | Location : United States







Related Discussions:- Column major representation, Assignment Help, Ask Question on Column major representation, Get Answer, Expert's Help, Column major representation Discussions

Write discussion on Column major representation
Your posts are moderated
Related Questions
Define the term counting - Pseudocode Counting in 1s is quite simple; use of statement count = count + 1 would enable counting to be done (for example in controlling a repeat

how to implement multiple stack using single dimension array in c

Explain State Space Tree If it is convenient to execute backtracking by constructing a tree of choices being made, the tree is known as a state space tree. Its root indicates a

An adjacency matrix representation of a graph cannot having information of : Parallel edges

The simplest implementation of the Dijkstra's algorithm stores vertices of set Q into an ordinary linked list or array, and operation Extract-Min(Q) is just a linear search through

What is bubble sort? Bubble Sort: The basic idea in bubble sort is to scan the array to be sorted sequentially various times. Every pass puts the largest element in its corr

Row Major Representation In memory the primary method of representing two-dimensional array is the row major representation. Under this representation, the primary row of the a

Define Spanning Tree A Spanning Tree of a connected graph is its linked acyclic sub graph (i.e., a tree) that having all the vertices of the graph.

Explain about the Structured types - Built-In Types Values of the carrier set are not atomic, consisting rather than several atomic values arranged in some way. Common illu

A company is carrying out a survey by observing traffic at a road junction. Every time a car, bus or lorry passed by road junction it was noted down. 10 000 vehicles were counted d