Overview of Three Dimensional Array

A multidimensional array is an array consisting of more than 2 dimensions.  We can perceive three dimensions at most. To visual 3-dimensional array, let's take an example of a cube.



Therefore, the array is cube[3][3][3].

For better understanding, represent a 3-D array as a combination of 2-D arrays. 
Note: The two-dimensional array must have the same size.


To conclude, a three dimensional array has arr[sub-array number][row][column].

Application of 3-D array:
  • To represent real-world location co-ordinates.
  • For storing spatial data such as MRI data.
  • 3-D modelling.

Comments

Post a Comment

Popular posts from this blog

Overview of Tree Data Structure

Image
The tree is an abstract data structure which stores hierarchical data. For example, organisations have a hierarchical structure for employees. It is similar to the image given below. Several sergeants have to report to their respective captain. Now captains report to colonel. This colonel takes order from the general and assigns them to sergeants. Each of these consists of several levels. The general is on level 0, Colonel A and Colonel V are on level 1, Captain A, B and C are on level 2 and so on. Another terminology is height of the tree.  The height of a tree is longest path from the root node to any leaf node of the tree. Height of leaf node n=Level of leaf n+1.  Suppose we want to find the height of Private A. Height of private A= Level of Private A+1                                       =4+1                 ...
Read more

Overview of Circular Queue

Image
 Let's say another student wants to wait in the  queue to get his/her assignment checked. There is space available on the bench, but the student cannot occupy it.  If the students shift to left, then they can make space the new student. However, this is very time-consuming. So, logically the person would occupy the vacant seat. But, will make sure that when the professor calls the early entrants will go first. Assume a queue of length l. When the queue is empty, the number assigned to the front and rear is -1. In a circular queue, the front index comes right after the last index. Algorithm for enqueue: The queue is overflow if front=0 and rear=l-1. End the program. There are two cases for insertion: There is space from the rear side. If rear<l-1, then insert the element at queue[rear] and increment rear. There is space from front side.If rear=l-1 and front!=0, then set rear=0 and insert element at queue[rear]. Algorithm for dequeue: The queue is underflowing if rear=f...
Read more