DATASTRUCTURE
What is Data Structure?
A data structure is a storage that is used to store and organize data. It is a way of arranging data on a
computer so that it can be accessed and updated efficiently.
Linear Data Structure: Data structure in which data elements are arranged sequentially or linearly,
where each element is attached to its previous and next adjacent elements, is called a linear data
structure.
Example: Array, Stack, Queue, Linked List, etc.
Static Data Structure: Static data structure has a fixed memory size. It is easier to access the elements in
a static data structure.
Example: array.
Dynamic Data Structure: In dynamic data structure, the size is not fixed. It can be randomly updated
during the runtime which may be considered efficient concerning the memory (space) complexity of the
code.
Example: Queue, Stack, etc.
Non-Linear Data Structure: Data structures where data elements are not placed sequentially or linearly
are called non-linear data structures. In a non-linear data structure, we can’t traverse all the elements in
a single run only.
Examples: Trees and Graphs.
, ARRAYS
Arrays are defined as the collection of similar types of data items stored at contiguous memory
locations. It is one of the simplest data structures where each data element can be randomly accessed by
using its index number.
Representation of Array:
•Index starts with 0.
•The array's length is 10, which means we can store 10 elements.
•Each element in the array can be accessed via its index.
▪︎0 (zero-based indexing): ▪︎The first element of the array will be arr[0].
▪︎1 (one-based indexing): The first element of the array will be arr[1].
▪︎n (n - based indexing): The first element of the array can reside at any random index number.
In the above image, we have shown the memory allocation of an array arr of size 5.
The array follows a 0-based indexing approach. The base address of the array is 100
bytes. It is the address of arr[0]. Here, the size of the data type used is 4 bytes;
therefore, each element will take 4 bytes in the memory.
What is Data Structure?
A data structure is a storage that is used to store and organize data. It is a way of arranging data on a
computer so that it can be accessed and updated efficiently.
Linear Data Structure: Data structure in which data elements are arranged sequentially or linearly,
where each element is attached to its previous and next adjacent elements, is called a linear data
structure.
Example: Array, Stack, Queue, Linked List, etc.
Static Data Structure: Static data structure has a fixed memory size. It is easier to access the elements in
a static data structure.
Example: array.
Dynamic Data Structure: In dynamic data structure, the size is not fixed. It can be randomly updated
during the runtime which may be considered efficient concerning the memory (space) complexity of the
code.
Example: Queue, Stack, etc.
Non-Linear Data Structure: Data structures where data elements are not placed sequentially or linearly
are called non-linear data structures. In a non-linear data structure, we can’t traverse all the elements in
a single run only.
Examples: Trees and Graphs.
, ARRAYS
Arrays are defined as the collection of similar types of data items stored at contiguous memory
locations. It is one of the simplest data structures where each data element can be randomly accessed by
using its index number.
Representation of Array:
•Index starts with 0.
•The array's length is 10, which means we can store 10 elements.
•Each element in the array can be accessed via its index.
▪︎0 (zero-based indexing): ▪︎The first element of the array will be arr[0].
▪︎1 (one-based indexing): The first element of the array will be arr[1].
▪︎n (n - based indexing): The first element of the array can reside at any random index number.
In the above image, we have shown the memory allocation of an array arr of size 5.
The array follows a 0-based indexing approach. The base address of the array is 100
bytes. It is the address of arr[0]. Here, the size of the data type used is 4 bytes;
therefore, each element will take 4 bytes in the memory.
