1.1 Arrays in Data Structure | Declaration,
Initialization, Memory representation
In this video, we'll discuss how data is represented in memory, and the need for
arrays. Faerie explains the need for arrays as we often have to process large
amounts of data, and arrays allow us to store multiple values under one variable
name. We'll cover how arrays can be declared and how data can be stored in
memory. The declaration of arrays is language-specific, and in this video, we'll
consider the syntax in the C language. The elements of the array are stored in
consecutive or continuous locations, with their index starting from zero. The size
of the array cannot be changed at runtime. We'll discuss how data is stored in
memory, with the binary form of the data being converted and then stored. The
formula to calculate the address of an element is the base address plus the
index value multiplied by the size of the data type. We'll cover how to initialize
the array at runtime using loops or predefined functions, and ho w to take data
from the user and store it in an array. In the next video, we'll discuss how to
insert data, traverse arrays, and perform different operations on 1D arrays. We'll
also cover 2D arrays and how to access their values.
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 so I'll see you in the next video.
1.3 Array Operations | Deletion from Array |
Explanation with Code | Data Structure
And finally, we'll discuss the time complexity.value so delete the value at
position four so now the updated area is now 5 and if you want to print this
then you can write this value down at the bottom of the for loop and then you
can print this value at the top of the for loop
,1.4 Pointers and 2-D Arrays | Two dimensional Array
| Data Structures & Algorithm Tutorials
In this video we 'll discuss how to da Rays are related with pointers how
you can access the elements of a 2d array with the help of pointer
rather than using the array name. If you have discussed the relationship
between arrays and pointers I mean that 1d array and pointers you can
check out that video also in that I button. A of 0 contains these three
integer values and this is the base address of these arrays. P can contain
address of an integer variable only so this is invalid right so here can we
write P is equal to CP contains address of some another integer variable
address off integer readable so can I write here a the name of theory. If
you want to print in hexadecimal form you can write down percentage
P. you fine it will print in unsigned integer some integer value so you
can print if you print in printf I guess you can. write printf % is you and
you. can write what a simply the name of the area or it will give what
the address of the first element first element is what a of 0 0 is what 100
only fine you can say that base address of this is 100.
1d array value doesn't mean does n't mean that it is returning either six
two or five because at a over zero at this address it will return at this
element. If you write this 1s trick a plus 1 then what should be the value
C this a name of the 2d array. A means same name of this 2d array it is
going to points to the first element but you can say it's going to return
the address of first element. If you do s trick a of 1 it means when you
act this pointer value at this address when you is this complete 1d array
value is not single integer value. Esther explains how to print a of 1 plus
2 plus two and you just write a straight fine. Esther says the output of
this thing should be the output, just think about it see Esther it a here
step by step here in to solve this a a means it is going to return a snake
of 2d array. Esther: If you you are going to print this value then simply
you can write say this one this is same this is giving.
A straight a astray K means value at this address value is what value is
this complete 1d array fine or you can say address of its first element
first element in 2d arrays this complete one dear so it is going to return
pointer to this one da find out. If you print history s trick a then what
will be the output of AD Esther that's tricky and Esther gets trick P.
, Address of a means it is going to give you the address of the first
element of the array. If you print a and address of a a a means name of
an array C name of there is address of a and a both will return 200 fine.
If a plus one arithmetic plus one in the pointer then it is pointing to the
CUDA obviously the next element. here 1 2 1 2 the next element it is
going to switch this complete array then it is. going to point this the
next. element of or you can say the next one the error that is 1 2 4 this
is the difference between this and this see I can now discuss everything
in one video so it 's up to you you can try different different different
expressions like this.
2.1 Introduction to Linked List | Need of Linked List |
DSA Tutorials
Memory is very crucial data source in our system we do n't have unlimited
memory in a computer system fine so it is a responsibility of a memory manager
to manage this resource. Memory manager will allocate how many bytes 3 into 4
that is 2 any bytes fine so let us suppose one complete block of 12 bytes has
been allocated suppose from 102 from hundred to this one one one this is free.
In advance the programmer told that I want size for only three integers so he
has allocated 12 bytes now what a memory manager will say he 'll say I can not
extend the size of your area because I have already allocated that that
consecutive block to some other variable. Memory is not free the memory
manager can not allocate this free memory to another variable but this
programmer is not using that memory so this is what the wastage of memory is
there. Linked lists is also a collection of elements and arrays were also a
collections of elements. The only difference is this data items are not storing
consecutive locations because this in area these are stored in consecutive
location continuous location. some cases then fresh a block of 452 452 elements
how many bytes 52 into 4 so 2 0 8 bytes would be allocated a new block of to 0
8 byte would be.
The memory manager will allocate space for all the five variables some fresh
block would be allocated no why so because these values are not not in
contiguous locations so if anywhere space is available for 8 bytes then memory
manager can allocate space they are only fine and we can provide space. Link to
link into this node for that new node inserted but in array we can not do this
because in array drobik is what all the value should be in consecutive locations.
In case of linked list cygnus here this particular node is containing two values
Initialization, Memory representation
In this video, we'll discuss how data is represented in memory, and the need for
arrays. Faerie explains the need for arrays as we often have to process large
amounts of data, and arrays allow us to store multiple values under one variable
name. We'll cover how arrays can be declared and how data can be stored in
memory. The declaration of arrays is language-specific, and in this video, we'll
consider the syntax in the C language. The elements of the array are stored in
consecutive or continuous locations, with their index starting from zero. The size
of the array cannot be changed at runtime. We'll discuss how data is stored in
memory, with the binary form of the data being converted and then stored. The
formula to calculate the address of an element is the base address plus the
index value multiplied by the size of the data type. We'll cover how to initialize
the array at runtime using loops or predefined functions, and ho w to take data
from the user and store it in an array. In the next video, we'll discuss how to
insert data, traverse arrays, and perform different operations on 1D arrays. We'll
also cover 2D arrays and how to access their values.
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 so I'll see you in the next video.
1.3 Array Operations | Deletion from Array |
Explanation with Code | Data Structure
And finally, we'll discuss the time complexity.value so delete the value at
position four so now the updated area is now 5 and if you want to print this
then you can write this value down at the bottom of the for loop and then you
can print this value at the top of the for loop
,1.4 Pointers and 2-D Arrays | Two dimensional Array
| Data Structures & Algorithm Tutorials
In this video we 'll discuss how to da Rays are related with pointers how
you can access the elements of a 2d array with the help of pointer
rather than using the array name. If you have discussed the relationship
between arrays and pointers I mean that 1d array and pointers you can
check out that video also in that I button. A of 0 contains these three
integer values and this is the base address of these arrays. P can contain
address of an integer variable only so this is invalid right so here can we
write P is equal to CP contains address of some another integer variable
address off integer readable so can I write here a the name of theory. If
you want to print in hexadecimal form you can write down percentage
P. you fine it will print in unsigned integer some integer value so you
can print if you print in printf I guess you can. write printf % is you and
you. can write what a simply the name of the area or it will give what
the address of the first element first element is what a of 0 0 is what 100
only fine you can say that base address of this is 100.
1d array value doesn't mean does n't mean that it is returning either six
two or five because at a over zero at this address it will return at this
element. If you write this 1s trick a plus 1 then what should be the value
C this a name of the 2d array. A means same name of this 2d array it is
going to points to the first element but you can say it's going to return
the address of first element. If you do s trick a of 1 it means when you
act this pointer value at this address when you is this complete 1d array
value is not single integer value. Esther explains how to print a of 1 plus
2 plus two and you just write a straight fine. Esther says the output of
this thing should be the output, just think about it see Esther it a here
step by step here in to solve this a a means it is going to return a snake
of 2d array. Esther: If you you are going to print this value then simply
you can write say this one this is same this is giving.
A straight a astray K means value at this address value is what value is
this complete 1d array fine or you can say address of its first element
first element in 2d arrays this complete one dear so it is going to return
pointer to this one da find out. If you print history s trick a then what
will be the output of AD Esther that's tricky and Esther gets trick P.
, Address of a means it is going to give you the address of the first
element of the array. If you print a and address of a a a means name of
an array C name of there is address of a and a both will return 200 fine.
If a plus one arithmetic plus one in the pointer then it is pointing to the
CUDA obviously the next element. here 1 2 1 2 the next element it is
going to switch this complete array then it is. going to point this the
next. element of or you can say the next one the error that is 1 2 4 this
is the difference between this and this see I can now discuss everything
in one video so it 's up to you you can try different different different
expressions like this.
2.1 Introduction to Linked List | Need of Linked List |
DSA Tutorials
Memory is very crucial data source in our system we do n't have unlimited
memory in a computer system fine so it is a responsibility of a memory manager
to manage this resource. Memory manager will allocate how many bytes 3 into 4
that is 2 any bytes fine so let us suppose one complete block of 12 bytes has
been allocated suppose from 102 from hundred to this one one one this is free.
In advance the programmer told that I want size for only three integers so he
has allocated 12 bytes now what a memory manager will say he 'll say I can not
extend the size of your area because I have already allocated that that
consecutive block to some other variable. Memory is not free the memory
manager can not allocate this free memory to another variable but this
programmer is not using that memory so this is what the wastage of memory is
there. Linked lists is also a collection of elements and arrays were also a
collections of elements. The only difference is this data items are not storing
consecutive locations because this in area these are stored in consecutive
location continuous location. some cases then fresh a block of 452 452 elements
how many bytes 52 into 4 so 2 0 8 bytes would be allocated a new block of to 0
8 byte would be.
The memory manager will allocate space for all the five variables some fresh
block would be allocated no why so because these values are not not in
contiguous locations so if anywhere space is available for 8 bytes then memory
manager can allocate space they are only fine and we can provide space. Link to
link into this node for that new node inserted but in array we can not do this
because in array drobik is what all the value should be in consecutive locations.
In case of linked list cygnus here this particular node is containing two values
