Representation of arrays, Data Structure & Algorithms


This is not uncommon to determine a large number of programs which procedure the elements of an array in sequence. However, does it mean that the elements of an array are also stored in a particular sequence in memory. The answer based on the operating system under which the program is running. Though, the elements of an array are stored in particular sequence to the extent possible. If they are being stored in a particular sequence, then how are they sequenced. Is it that the elements are stored row wise or column wise? Again, it based on the operating system. The former is called as row major order & the later on is called column major order.

Posted Date: 4/4/2013 6:45:11 AM | Location : United States

Related Discussions:- Representation of arrays, Assignment Help, Ask Question on Representation of arrays, Get Answer, Expert's Help, Representation of arrays Discussions

Write discussion on Representation of arrays
Your posts are moderated
Related Questions
An adjacency matrix representation of a graph cannot having information of : Parallel edges

Q. Explain that how do we implement two stacks in one array A[1..n] in such a way that neither the stack overflows unless the total number of elements in both stacks together is n.

merge sort process for an example array {38, 27, 43, 3, 9, 82, 10}. If we take a closer look at the diagram, we can see that the array is recursively divided in two halves till the

Define tractable and intractable problems Problems that can be solved in polynomial time are known as tractable problems, problems that cannot be solved in polynomial time are

Thus far, we have been considering sorting depend on single keys. However, in real life applications, we may desire to sort the data on several keys. The simplest instance is that

what is the difference between data type and abstract data type

Q. Prove the hypothesis that "A tree having 'm' nodes has exactly (m-1) branches".      Ans: A tree having m number of nodes has exactly (m-1) branches Proof: A root

Abstract data type The thing which makes an abstract data type abstract is that its carrier set and its operations are mathematical entities, like geometric objects or numbers;

Multiplication Method: The multiplication method operates in 2 steps. In the 1ststep the key value K is multiplied by a constant A in the range O

i need the full concept of it... please can anyone provide