1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
(remember that array indices always begin by zero).
Multidimensional arrays are not limited to two indices (i.e., two dimensions).
They can contain as many indices as needed. But be careful! The amount of
memory needed for an array rapidly increases with each dimension.
For example:
char century [100][365][24][60][60];
declares an array with a char element for each second in a century, that is more
than 3 billion chars. So this declaration would consume more than 3 gigabytes
of memory!
Address Calculations in One‐dimensional arrays
The one dimensional arrays are also known as Single dimension array and is a
type of Linear Array. In the one dimension array the data type is followed by the
variable name which is further followed by the single subscript i.e. the array can
be represented in the row or column wise. It contains a single subscript that is
why it is known as one dimensional array because one subscript can either
represent a row or a column.
The address of a particular element in a one‐dimensional array is given by the
relation:
Address of element a[k] = B+W*K
Where B is the base address of the array, W is the size of each element of array
, and k is the number of required element in the array (index of element) which
should be a integer quantity. For example:
Let the base address of the first element of the array is 2000( i. e, base address B
is =2000), and each element of the array occupies four bytes in the memory,
then address of fifth element of a one dimensional array a[10] will be given as:
Address of element a [5] =2000+4*5=2000+20=2020
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 35 ‐