Q. Describe what do you understand by the term array? How does an array vary from an ordinary variable? How are the arrays represented in the specific memory?                                    

Ans.

Array Vs. Ordinary Variable is explained as follows

Array is made from the similar data structure that exists in any language. Array is the set of similar or alike data types. Array is the collection of similar or alike elements. These similar or alike elements could be all int or all float or all char etc. Array of char is called as string. All elements of the given array should be of same type. An array is finite ordered set of the homogeneous elements. The number of elements in the array is pre- determined.

For example.  Ordinary variable: - int a

Array:      -      int a[10]

An ordinary variable of a simple data type can save a single element only

Representation of Array in memory is shown below

Assume a be a 2 dimensional m x n array

 

	Col 0	Col 1	Col 2
Row 0	a00	a01	a02
Row 1	a10	a11	a12
Row 2	a20	a21	a22

 

Though  a  is  pictured  as  a  rectangular pattern  with  in  row  and  n  column  it  is represented in memory or a particular location by a row of m x n  elements. Sequential memory locations the element can be saved in row major order.

Column major order is explained as follows:- the elements are saved column by column i.e. m elements of the 1st column is saved in first m locations, elements of the 2nd column are saved in next m location and so on..

Row major order is shown below:-

The elements are saved row by row ie. N elements of the 1st row are saved in 1st n location, elements of 2nd row are saved in next n location, and so on

Posted Date: 7/13/2012 2:03:12 AM | Location : United States

Ask an Expert

Related Discussions:- Array vs. ordinary variable, Assignment Help, Ask Question on Array vs. ordinary variable, Get Answer, Expert's Help, Array vs. ordinary variable Discussions

Write discussion on Array vs. ordinary variable
Your posts are moderated

Write your message here..

Related Questions

File organization, Define File organization''s and it''s types Define File organization''s and it''s types

The theta-notation, This notation bounds a function to in constant factors.... This notation bounds a function to in constant factors. We say f(n) = Θ(g(n)) if there presents positive constants n 0 , c 1 and c 2 such that to the right of n 0 the value of f

Sparse matrix, Q. Define a sparse matrix. Explain different types of sparse... Q. Define a sparse matrix. Explain different types of sparse matrices? Show how a triangular array is stored in memory. Evaluate the method to calculate address of any element ajk

Write the algorithm of the quick sort, Ans. An algorithm for the quick... Ans. An algorithm for the quick sort is as follows: void quicksort ( int a[ ], int lower, int upper ) { int i ; if ( upper > lower ) { i = split ( a, lower, up

Balance tree, what is a balance tree? what is a balance tree?

Abstract type, define abstract type define abstract type

Write down the procedure to reverse a singly linked list. , Ans: A pr... Ans: A procedure to reverse the singly linked list: reverse(struct node **st) { struct node *p, *q, *r; p = *st; q = NULL; while(p != NULL) { r =q;

Notes, Ask question #Minimum 10000 words accepted# Ask question #Minimum 10000 words accepted#

Complexity, Complexity : How do the resource needs of a program or algorith... Complexity : How do the resource needs of a program or algorithm scale (the growth of resource requirements as a function of input). In other words, what happens with the performan

Methods, what is folding method? what is folding method?