Explain multidimensional array, Data Structure & Algorithms

Multidimensional array: Multidimensional arrays can be defined as "arrays of arrays". For example, a bidimensional array can be imagined as a bidimensional table made of elements, all of them of a similar uniform data type.    int  arr[3][5];  represents a bidimensional array of 3 per 5 elements of type int.   

 

Posted Date: 5/10/2013 4:00:59 AM | Location : United States







Related Discussions:- Explain multidimensional array, Assignment Help, Ask Question on Explain multidimensional array, Get Answer, Expert's Help, Explain multidimensional array Discussions

Write discussion on Explain multidimensional array
Your posts are moderated
Related Questions
The data structure needed to evaluate a postfix expression is  Stack

Using stacks, write an algorithm to determine whether the infix expression has balanced parenthesis or not Algorithm parseparens This algorithm reads a source program and

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

What is a height balanced tree? Height Balanced Tree (AVL Tree) An AVL tree is a binary search tree in which the height of the left and right subtree of the root vary by at most

a) Given a digraph G = (V,E), prove that if we add a constant k to the length of every arc coming out from the root node r, the shortest path tree remains the same. Do this by usin

Materials consumed are priced in a systematic and realistic manner. It is argued that current acquisition costs are incurred for the purpose of meeting current production and sales

The data structure needed for Breadth First Traversal on a graph is Queue

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

Evaluate the frequency counts for all statements in the following given program segment. for (i=1; i ≤ n; i ++) for (j = 1; j ≤ i; j++) for (k =1; k ≤ j; k++) y ++;

Comp are two functions n 2    and  2 n  / 4  for distinct values of n.   Determine When s ec on d function b ec om es l a r g er th an f i r st functi