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
Document processing is quickly becoming one of the dominant functions of computers. Computers are utilized to edit, search & transport documents over the Internet, and to display d

In the earlier unit, we have discussed about the arrays. Arrays are data structures of fixed size. Insertion & deletion involves reshuffling of array elements. Thus, arraymanipulat


Linked lists are among the most common and easiest data structures. They may be used to implement various other common abstract data types, including queues, stacks, symbolic expre

What is an unreachable code assertion An unreachable code assertion can be placed at the default case; if it's every executed, then program is in an erroneous state. A loop in

Use a random number generator to create 10 numbers between 1 and 1000 and store them in 2 different arrays.  The first array should contain the numbers as they are generated.  The

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.

Using the cohen sutherland. Algorithm. Find the visible portion of the line P(40,80) Q(120,30) inside the window is defined as ABCD A(20,20),B(60,20),C(60,40)and D(20,40)

Explain about the Abstract data type Abstract data type (ADT) A set of values (the carrier set) and operations on those values

For splaying, three trees are maintained, the central, left & right sub trees. At first, the central subtree is the complete tree and left and right subtrees are empty. The target