Representation of arrays, Data Structure & Algorithms

REPRESENTATION OF ARRAYS

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
In this sorting algorithm, multiple swapping occurs in one pass. Smaller elements move or 'bubble' up to the top of the list, so the name given to the algorithm. In this method,

Q. Reverse the order of the elements on a stack S    (i) by using two additional stacks (ii) by using one additional queue. Ans :      L e t S be the stac

i want to write code for unification algorithm with for pattern matching between two expression with out representing an expression as alist

Determine the stereo vision There is still one more major item missing, before we can look at a computer display or plot and perceive it just as we see a real object, namely th

Explain the array and linked list implementation of stack

an electrical student designed a circuit in which the impedence in one part of a series circuit is 2+j8 ohms and the impedent is another part of the circuit is 4-j60 ohm mm program

for(int i = 0; i for (int j = n - 1; j >= i ; j--){ System.out.println(i+ " " + j);

1)    The set of the algorithms whose order is O (1) would run in the identical time.  True/False 2)    Determine the complexity of the following program into big O notation:

A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is called as a   Queue.

Given is the structure of an AVL tree: struct avl { struct node *left; int info; int bf; struct node *right; }; 2) A multiway tree of n order is an ord