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

Fifo, give any example of page replacement using fifo and use your own refe... give any example of page replacement using fifo and use your own reference string

Explain linked list and its types, Data Structure and Algorithm 1. Exp... Data Structure and Algorithm 1. Explain linked list and its types. How do you represent linked list in memory? 2. List and elucidate the types of binary tree. 3. Descr

Sparse matrix, How sparse matrix stored in the memory of a computer? How sparse matrix stored in the memory of a computer?

Explain complexity of an algorithm, Complexity of an Algorithm An algo... Complexity of an Algorithm An algorithm is a sequence of steps to solve a problem; there may be more than one algorithm to solve a problem. The choice of a particular algorith

Deletion of a node from an avl tree, For AVL trees the deletion algorithm i... For AVL trees the deletion algorithm is a little more complicated as there are various extra steps involved in the deletion of node. If the node is not a leaf node, then it contain

Double linked list, In a doubly linked list, also called as 2 way list, eac... In a doubly linked list, also called as 2 way list, each node is divided into 3 parts. The first part is called previous pointer field. It contains the address of the preceding

Sorting, explain quick sort algorithm explain quick sort algorithm

Preorder traversal of a binary tree, Preorder traversal of a binary tree ... Preorder traversal of a binary tree struct NODE { struct NODE *left; int value;     /* can take any data type */ struct NODE *right; };   preorder(struct N

Conversion of general trees into the binary trees, By taking an appropriate... By taking an appropriate example explain how a general tree can be represented as a Binary Tree.                                                                    C onversio

Pseudocodes, how to write a pseudo code using Kramer''s rule how to write a pseudo code using Kramer''s rule