1.1 Arrays in Data Structure | Declaration, Initialization,
Memory representation
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 how 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.
be stored in memory now as you can see theory is stored in 20 bytes memory
starting from the 0th byte and ending at the 19th byte. So theory is stored in
consecutive bytes in memory. Now If I want to access any of these elements, I will
use the indexing operator, which is the square bracket []. So I can say here [0] that
is the first element of this array. Now if I want to access any other element. I will
use the indexing operator again and this time I will use the plus sign (+). So I can
say here [1] that is the second element of this array and so on until I reach the last
element of this array, which is [19]. So this is how you can access any of these
elements of the array using the indexing operator [] and then using the plus sign
(+) see now Another way to initialize an array at runtime is by using a pointer
variable. See now suppose we have a pointer variable ca lled p that points to an
area in memory that contains an array called [UNK] fine now at runtime. We can say
p->elements[0] that is referencing the first element of [UNK] See now Another way
to initialize an array at runtime is by using a const pointer vari able. See now
suppose we have a const pointer variable called p that points to an area in memory
that contains an array called [UNK] fine now at runtime. We can say const p-
>elements[0] that is referencing the first element of [UNK]. See now Another way to
initialize an array at runtime is. a dynamic pointer variable see now suppose we
have a dynamic pointer variable called P that points to an area in memory that
contains an array called [UNK] fine. Now at runtime, we can say p->elements[0] that
Memory representation
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 how 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.
be stored in memory now as you can see theory is stored in 20 bytes memory
starting from the 0th byte and ending at the 19th byte. So theory is stored in
consecutive bytes in memory. Now If I want to access any of these elements, I will
use the indexing operator, which is the square bracket []. So I can say here [0] that
is the first element of this array. Now if I want to access any other element. I will
use the indexing operator again and this time I will use the plus sign (+). So I can
say here [1] that is the second element of this array and so on until I reach the last
element of this array, which is [19]. So this is how you can access any of these
elements of the array using the indexing operator [] and then using the plus sign
(+) see now Another way to initialize an array at runtime is by using a pointer
variable. See now suppose we have a pointer variable ca lled p that points to an
area in memory that contains an array called [UNK] fine now at runtime. We can say
p->elements[0] that is referencing the first element of [UNK] See now Another way
to initialize an array at runtime is by using a const pointer vari able. See now
suppose we have a const pointer variable called p that points to an area in memory
that contains an array called [UNK] fine now at runtime. We can say const p-
>elements[0] that is referencing the first element of [UNK]. See now Another way to
initialize an array at runtime is. a dynamic pointer variable see now suppose we
have a dynamic pointer variable called P that points to an area in memory that
contains an array called [UNK] fine. Now at runtime, we can say p->elements[0] that
