1.1 Arrays in Data Structure | Declaration, Initialization,
Memory representation
Jenny's Lectures CS IT
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
Jenny's Lectures CS IT
I am going to talk about various operations performed on arrays in data structure on 1d arrays
specifically. I have already discussed the fundamentals of arrays what is need of Faerie array
,declaration in acid ization of array memory representation of air in the previous video so if you
check out that video then I 'll provide you the link in the description box you can check out there.
We are going to write down the code for this. something like this I have already discussed in the
previous video this concept and detail fine. I 'm going to ask from the user what elements the
user wants in the area how to populate the area at runtime. We will just write header files and all
I think you can write that thing. Ask from the user that how many data the user want to insert in
this area what is the actual size of the array this is the maximum size fine. If user will give
something some input that is some integer value then obviously that value should be stored in
memory and how values to be stored using variable so you have to declare one another variable.
We will discuss how data is to be inserted in the air at specific position. If you get how data can
be inserted at a specific position then you can easily modify the code for inserting the data at
the beginning and at the end of theory fine so now we will see how to. We are using one more
variable that is i so you have to declare this variable. There is no upper bound checking concept
of areas in areas in C like this if you take hair in a is equal to 50 fine. Memory man is it has has
allocated to how many bytes two hundred bytes for storing 50 elements. If you enter the size 51
or you can say 60 then user can insert 60 values also but that is not actually correct. We all we
want all the previous element as well as we want some extra element that you want to insert so
you can not do directly this so another approach is what you can shift these elements to the
right side. From variable to start the loop we are going to start from here from the last element
of there you can say from size minus 1.
of bounds checking of arrays in c so programmer has to write down the code itself for the
checking of the boundaries in c. programmer must write down a for loop for the swapping of
arrays. Programmer writes down code that checks the boundaries of an array in c code. Just
write down a for loop in for loop you will start from 0 to the size fine and you simply write printf
percentage D and a of I and these all values would be printed this is how we are going to insert
the data at specific position fine. After inserting this number array size becomes what 6 so now
size becomes size plus plus plus right now finally you will print this area how you can print it.
How you will insert simply you just enter the data you want to insert simply. No need to ask the
position no need to do this swapping and all fine simply will write a off here here means you can
, say that size a of size size size is 5 5 so here also you can insert at 6th position that is also fine
but after size plus 1 you can not insert.
In best case it is one and in worst cases it is Theta N and basically time complexity the time
taken depends on the position given. In unsorted array you have to take care of the relative
ordering of the elements in sorted array in that case you are doing two shift operations so you
can apply this shifting operations in this unsorted area. delete data from the array so
1.3 Array Operations | Deletion from Array | Explanation with
Code | Data Structure
Jenny's Lectures CS IT
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
Memory representation
Jenny's Lectures CS IT
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
Jenny's Lectures CS IT
I am going to talk about various operations performed on arrays in data structure on 1d arrays
specifically. I have already discussed the fundamentals of arrays what is need of Faerie array
,declaration in acid ization of array memory representation of air in the previous video so if you
check out that video then I 'll provide you the link in the description box you can check out there.
We are going to write down the code for this. something like this I have already discussed in the
previous video this concept and detail fine. I 'm going to ask from the user what elements the
user wants in the area how to populate the area at runtime. We will just write header files and all
I think you can write that thing. Ask from the user that how many data the user want to insert in
this area what is the actual size of the array this is the maximum size fine. If user will give
something some input that is some integer value then obviously that value should be stored in
memory and how values to be stored using variable so you have to declare one another variable.
We will discuss how data is to be inserted in the air at specific position. If you get how data can
be inserted at a specific position then you can easily modify the code for inserting the data at
the beginning and at the end of theory fine so now we will see how to. We are using one more
variable that is i so you have to declare this variable. There is no upper bound checking concept
of areas in areas in C like this if you take hair in a is equal to 50 fine. Memory man is it has has
allocated to how many bytes two hundred bytes for storing 50 elements. If you enter the size 51
or you can say 60 then user can insert 60 values also but that is not actually correct. We all we
want all the previous element as well as we want some extra element that you want to insert so
you can not do directly this so another approach is what you can shift these elements to the
right side. From variable to start the loop we are going to start from here from the last element
of there you can say from size minus 1.
of bounds checking of arrays in c so programmer has to write down the code itself for the
checking of the boundaries in c. programmer must write down a for loop for the swapping of
arrays. Programmer writes down code that checks the boundaries of an array in c code. Just
write down a for loop in for loop you will start from 0 to the size fine and you simply write printf
percentage D and a of I and these all values would be printed this is how we are going to insert
the data at specific position fine. After inserting this number array size becomes what 6 so now
size becomes size plus plus plus right now finally you will print this area how you can print it.
How you will insert simply you just enter the data you want to insert simply. No need to ask the
position no need to do this swapping and all fine simply will write a off here here means you can
, say that size a of size size size is 5 5 so here also you can insert at 6th position that is also fine
but after size plus 1 you can not insert.
In best case it is one and in worst cases it is Theta N and basically time complexity the time
taken depends on the position given. In unsorted array you have to take care of the relative
ordering of the elements in sorted array in that case you are doing two shift operations so you
can apply this shifting operations in this unsorted area. delete data from the array so
1.3 Array Operations | Deletion from Array | Explanation with
Code | Data Structure
Jenny's Lectures CS IT
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
