Introduction to Data Structure with real life
examples
I will discuss what data structure is, its use and where do we see or use
it in the real life. Big companies like Google and Amazon are collecting
data in a large amount on a daily basis. Since the data is being
collected there will be some organization and management for it and
we will also have to give a storage format to it. This is known as Data
Structure. Data Structure is neither a software nor a data type like
integer or float. Data structure is simply a way to store the data. The
data structure is the base for everything including your application,
software, and website. If they are working well, It means that there is a
data structure behind it which is its base. For instance, when you
search for something on Google, thousands of users are searching
simultaneously , and you still get the results with the same speed.
When you buy any product on amazon, you enter a book Data structure
you immediately get the reviews. There is stack , queue , and array.
This is used in high-level languages like C, C++ and Java. The array is
also used for implementing data structures like stack and queue. So
quickly like the video and subscribe to the channel. The number of
participants is fixed and the type is either male or female. In C and C+
+, an array is always started with 0. But since I am giving you a
general example , I have started it from 1. I have drawn the 5 locations
of the array inside the memory here. We will not give different names
to different elements. A unique name will be given to every element
but its position will be determined by its index number. This is the
memory of 5 elements which is contiguous. This was all about the
elements in the memory , how we can access them. There is a defined
position for each element and they use contiguous memory. To find the
total number of elements or the size of the array, the formula will be
UB-LB+1. The upper bound is 5, minus lower bound , which is 1, plus
1.You can take anything here. I used a general array and explained you
by starting from 1. This was the introduction part of array. We will
discuss arrays in more detail in the upcoming videos. There are two
types of array. The first is One-dimensional array and the other is
Multidimensional array. In one dimensional array, we use a single
dimension to access the data. When there are multiple dimensions, it is
known as multidimensional. In multi-dimensional arrays, we will
increase the dimensions. In the 2d array, there will be a dimension for
the rows and another for the number of columns. There will be three
rows and four columns. The number of arrays is 2. The rows in those
arrays will be 3 rows and the columns will be 4. The total number of
elements will be 12. The base address will be. . . look here. This is 0 ,
and this is 1. 0 links the first array and 1 links the second array. This is
not the memory representation. This matrics form is not that. All the 2d
or 3d arrays are stored as 1d arrays in the memory. We just see it this
way because we are representing it in front of you in this way. To find
the address, we must know the base address. We started its base
address from 3000. The address of the first element is 3000. Plus, how
many elements we have crossed ? How many elements do we need to
cross here ? I will have to cross 2 elements. Where did we start the
index ? From 0. The data structure is not dependent on any language. If
we start from 1 and we need to find the location of A [ 2 ] , how can we
do so ? The base address of it is 3000. Plus, How many elements do we.
need to cross 1 element. We will write ' 1 ' here. What will be the value
examples
I will discuss what data structure is, its use and where do we see or use
it in the real life. Big companies like Google and Amazon are collecting
data in a large amount on a daily basis. Since the data is being
collected there will be some organization and management for it and
we will also have to give a storage format to it. This is known as Data
Structure. Data Structure is neither a software nor a data type like
integer or float. Data structure is simply a way to store the data. The
data structure is the base for everything including your application,
software, and website. If they are working well, It means that there is a
data structure behind it which is its base. For instance, when you
search for something on Google, thousands of users are searching
simultaneously , and you still get the results with the same speed.
When you buy any product on amazon, you enter a book Data structure
you immediately get the reviews. There is stack , queue , and array.
This is used in high-level languages like C, C++ and Java. The array is
also used for implementing data structures like stack and queue. So
quickly like the video and subscribe to the channel. The number of
participants is fixed and the type is either male or female. In C and C+
+, an array is always started with 0. But since I am giving you a
general example , I have started it from 1. I have drawn the 5 locations
of the array inside the memory here. We will not give different names
to different elements. A unique name will be given to every element
but its position will be determined by its index number. This is the
memory of 5 elements which is contiguous. This was all about the
elements in the memory , how we can access them. There is a defined
position for each element and they use contiguous memory. To find the
total number of elements or the size of the array, the formula will be
UB-LB+1. The upper bound is 5, minus lower bound , which is 1, plus
1.You can take anything here. I used a general array and explained you
by starting from 1. This was the introduction part of array. We will
discuss arrays in more detail in the upcoming videos. There are two
types of array. The first is One-dimensional array and the other is
Multidimensional array. In one dimensional array, we use a single
dimension to access the data. When there are multiple dimensions, it is
known as multidimensional. In multi-dimensional arrays, we will
increase the dimensions. In the 2d array, there will be a dimension for
the rows and another for the number of columns. There will be three
rows and four columns. The number of arrays is 2. The rows in those
arrays will be 3 rows and the columns will be 4. The total number of
elements will be 12. The base address will be. . . look here. This is 0 ,
and this is 1. 0 links the first array and 1 links the second array. This is
not the memory representation. This matrics form is not that. All the 2d
or 3d arrays are stored as 1d arrays in the memory. We just see it this
way because we are representing it in front of you in this way. To find
the address, we must know the base address. We started its base
address from 3000. The address of the first element is 3000. Plus, how
many elements we have crossed ? How many elements do we need to
cross here ? I will have to cross 2 elements. Where did we start the
index ? From 0. The data structure is not dependent on any language. If
we start from 1 and we need to find the location of A [ 2 ] , how can we
do so ? The base address of it is 3000. Plus, How many elements do we.
need to cross 1 element. We will write ' 1 ' here. What will be the value
