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
Explain in detail about the Ruby arrays Ruby arrays have many interesting and powerful methods. Besides indexing operations which go well beyond those discussed above, arrays h

Explain Division Method Division Method: - In this method, key K to be mapped into single of the m states in the hash table is divided by m and the remainder of this division

How can we convert a graph into a tree ? Do we have any standardized algorithm for doing this?

the deference between insertion,selection and bubble sort

Program Insertion of a node into any Circular Linked List Figure depicts a Circular linked list from which an element was deleted. ALGORITHM (Deletion of an element from a

Algorithm to Delete a given node from a doubly linked list Delete a Node from Double Linked List DELETEDBL(INFO, FORW, BACK, START, AVAIL,LOC) 1. [Delete Node] Set FOR

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.

Define an array. Array is made up of same data structure that exists in any language. Array is set of same data types. Array is the collection of same elements. These same elem

Develop a program that accepts the car registration( hint: LEA 43242010)

Containers Introduction Simple abstract data types are useful for manipulating simple sets of values, such as integers or real numbers however more complex abstract data t