1.1 Arrays in Data Structure | Declaration,
Initialization, Memory representation
data is to be represented in memory or you can see the memory
representation of an array. you will see what is the need of ferry what
does any types of ferry how areas can be declared how arrays can be.
be. declared and how data can be stored in memory. you will see how
the state has to be stored first of all this decimal number 5 has to. be
converted into binary it 's binary number sorry that is in 32 bits. faerie
explains what is need of faerie and how to deal with it. faerie: we have
to process large amount of return that is why the concept of array came
now you will modify this declaration such that under one variable name
we can store roll numbers of all 60 students that is what array now how
you can do this. declaration of arrays languagespecific i am considering
the syntax in c language in python maybe it 's different in pascal in you
can say that foreign language the declaration syntax would be a little
bit different so it is language specific fine now this is what the array
declaration is.
The data is stored in consecutive locations or continuous locations one
after another. The index starts from zero, but can also start from one.
The data is stored in binary form and the address of the data is
calculated in hexadecimal form.
At runtime, you can initialize the array using loops, maybe for loop
while you do loup and some predefined function standard functions
that is scanner. In next video, I'm going to discuss it how the data is to
be taken from the user how the data is to be stored in the array. In next
video, we are going to discuss how the data is to be inserted how the
arrays are to be traversed different types of operations on 1d array first
of all with their time taken. After that, we will discuss what is 2d array as
well as how 2d arrays are to be accessed from the air fine.
1.2 Array Operations - Traversal, Insertion |
Explanation with C Program | DSA Course
, You are also going to have to use the interposition function to insert
the data at the beginning of the area. Finally, you are going to have to
use the printf function to print the data at the end of the area.
delete data from the array
1.3 Array Operations | Deletion from Array |
Explanation with Code | Data Structure
I will discuss the deletion operation using the example I used in a
previous video. Understanding how to delete data from a specific
position will also make it easier to delete data from the beginning or
end of the array. I declared an array of size 50 in the previous code, and
the memory manager allocated 200 bytes of memory for this array. One
variable, size, is used to determine the maximum size of the array. If the
user wants to insert only 10 or 5 elements, for example, I will ask them
how much size they want for the array, and this will allocate an
additional 4 bytes of memory. The user will then enter the elements of
the array, which will be initialized at runtime. To delete data from the
array, I will ask the user from which position they want to delete the
data. For example, if they want to delete data from position 2, I will shift
the values from position 3 to 4 and reduce the size of the array by 1. I
will start a loop from the position to be deleted to the end of the array
and shift the values to the left. To print the updated array after deletion,
I will use a for loop to print each element of the array. It's important to
check the validity of the position entered by the user before deleting
data from the array. If the position is invalid, such as -1 or greater than
the size of the array, I will print "invalid position". If there is no data in
the array, it's also an underflow condition and the data cannot be
deleted. When deleting data from the end of the array, I will simply
decrement the size of the array. When deleting data from the beginning
of the array, I will shift all the elements to the left and decrement the
size of the array. The time complexity of the deletion operation depends
on the position from which the data is to be deleted. If the data is to be
deleted from a specific position, all the elements to the right of that
position must be shifted to the left, which takes O(n) time. However, if
the array is unsorted, a quicker algorithm is to pick the last element of
Initialization, Memory representation
data is to be represented in memory or you can see the memory
representation of an array. you will see what is the need of ferry what
does any types of ferry how areas can be declared how arrays can be.
be. declared and how data can be stored in memory. you will see how
the state has to be stored first of all this decimal number 5 has to. be
converted into binary it 's binary number sorry that is in 32 bits. faerie
explains what is need of faerie and how to deal with it. faerie: we have
to process large amount of return that is why the concept of array came
now you will modify this declaration such that under one variable name
we can store roll numbers of all 60 students that is what array now how
you can do this. declaration of arrays languagespecific i am considering
the syntax in c language in python maybe it 's different in pascal in you
can say that foreign language the declaration syntax would be a little
bit different so it is language specific fine now this is what the array
declaration is.
The data is stored in consecutive locations or continuous locations one
after another. The index starts from zero, but can also start from one.
The data is stored in binary form and the address of the data is
calculated in hexadecimal form.
At runtime, you can initialize the array using loops, maybe for loop
while you do loup and some predefined function standard functions
that is scanner. In next video, I'm going to discuss it how the data is to
be taken from the user how the data is to be stored in the array. In next
video, we are going to discuss how the data is to be inserted how the
arrays are to be traversed different types of operations on 1d array first
of all with their time taken. After that, we will discuss what is 2d array as
well as how 2d arrays are to be accessed from the air fine.
1.2 Array Operations - Traversal, Insertion |
Explanation with C Program | DSA Course
, You are also going to have to use the interposition function to insert
the data at the beginning of the area. Finally, you are going to have to
use the printf function to print the data at the end of the area.
delete data from the array
1.3 Array Operations | Deletion from Array |
Explanation with Code | Data Structure
I will discuss the deletion operation using the example I used in a
previous video. Understanding how to delete data from a specific
position will also make it easier to delete data from the beginning or
end of the array. I declared an array of size 50 in the previous code, and
the memory manager allocated 200 bytes of memory for this array. One
variable, size, is used to determine the maximum size of the array. If the
user wants to insert only 10 or 5 elements, for example, I will ask them
how much size they want for the array, and this will allocate an
additional 4 bytes of memory. The user will then enter the elements of
the array, which will be initialized at runtime. To delete data from the
array, I will ask the user from which position they want to delete the
data. For example, if they want to delete data from position 2, I will shift
the values from position 3 to 4 and reduce the size of the array by 1. I
will start a loop from the position to be deleted to the end of the array
and shift the values to the left. To print the updated array after deletion,
I will use a for loop to print each element of the array. It's important to
check the validity of the position entered by the user before deleting
data from the array. If the position is invalid, such as -1 or greater than
the size of the array, I will print "invalid position". If there is no data in
the array, it's also an underflow condition and the data cannot be
deleted. When deleting data from the end of the array, I will simply
decrement the size of the array. When deleting data from the beginning
of the array, I will shift all the elements to the left and decrement the
size of the array. The time complexity of the deletion operation depends
on the position from which the data is to be deleted. If the data is to be
deleted from a specific position, all the elements to the right of that
position must be shifted to the left, which takes O(n) time. However, if
the array is unsorted, a quicker algorithm is to pick the last element of
