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
Find a minimum cost spanning arborescence rooted at r for the digraph shown below, using the final algorithm shown in class. Please show your work, and also give a final diagram wh

Q. The given values are to be stored in a hash table 25, 42, 96, 101, 102, 162, 197 Explain how the values are hashed by using division technique of hashing with a table


1.  You are required to hand in both a hard copy and an electronic copy of the written report on the project described in A, including all the diagrams you have drawn.  2.  You

Explain class P problems Class  P  is  a  class  of  decision  problems  that  can  be  solved  in  polynomial time  by(deterministic) algorithms. This class of problems is kno

Ask consider the file name cars.text each line in the file contains information about a car ( year,company,manufacture,model name,type) 1-read the file 2-add each car which is repr


We have discussed already about three tree traversal methods in the earlier section on general tree. The similar three different ways to do the traversal -inorder , preorder, and p

Question 1 Describe the following- Well known Sorting Algorithms Divide and Conquer Techniques Question 2 Describe in your own words the different asymptotic func