DATA STRUCTURES NOTES
From this presentation onwards,, we will study a new
subject that is, data structures. and in this
presentation., I will introduce what data structure is
and some real-life examples of data structure. you
can think of a data as quantities,, characters or
symbols on which operations are performed by a
computer.. This is what data is. a data structure
structure is the systematic way to organize data so
that it can be used efficiently.. data structure gives
us the way to structure the data, to appropriately
manage the data. and not only that, we can use it
whenever required in an efficient way.. This is the
reason, why companies are preferring this subject
over other subjects because this is very important
subject.. did you know that stack data structure is
used in implementing Redo and undo feature.. You
know that this is the famous. that this is the famous
feature which we are using many number of times in
our applications.. one such application is Google
Docs,, or power, Point, or microsoft word.. That is
why, it is a very useful data structure for Us. now, let
's discuss some real-life examples of data structures..
The primary goal of Neso Academy is to give quality
education to '' actually, I want to write everyone but
accidentally, I have written ebery instead of every. I
press control Z, this element gets selected and you
know, it will get poped out of the stack and will get
placed within this redo stack. and you can see here.,
stack is our data structure. now, let 's see another
example.. data structures are useful in day to day life
and we using them more frequently, and that is why,
it is so hot in it industry. you can guess that, which
data structure is used to store this information. we
can use graph data structure to store information like
this. and now, you can understand why data
structures are so important..
, DATA STRUCTURES NOTES
Data Types vs. Abstract Data Types
In our journey towards learning data structures , we first
have to understand the difference between data types and
abstract data types. A data type defines a certain domain of
values but also defines what operations are allowed on those
values. In contrast to primitive data types, there is a concept
of user defined data types which is not pre defined in the
language itself. ADTs are like user defined data types which
defines operations on values using functions without
specifying what is there inside the function and how the
operations are performed. Think of ADT as a black box which
hides the inner structure and design of the data type from
the user. There are multiple ways to implement an ADT. A
stack ADT can be implemented using arrays or linked lists.
The program which uses data structure is called a client
program. It has access to the interface only and nothing
inside. The implementation can go on without affecting the
stack program. This is one of the biggest advantages of
using abstract data types.
Abstract data type provides abstraction which means hiding
details from the user and it is very important because user
does n't bother about how that particular thing is
implemented. He just have to use that thing. So, this
separation is required. That 's why abstract data type is very
useful concept.
Data Structure Definition & Advantages
In this presentation, we will discuss the formal definition
of data structures and discuss some of the advantages
of it. A data structure is the organization of the data in a
way so that it can be used efficiently. When I say
efficiently, it means in terms of time as well as space.
ADT tells us what is to be done and data structures tells
us how to do it. But how to know which data structure to
use for a particular ADT? That is the basic question.
Data structure is specified by an ADT. ADT is the
blueprint , while data structure is the implementation.
, DATA STRUCTURES NOTES
Data structure provides a level of abstraction. The client
program does n't have to worry about what is going
inside. It just sees the ADT , just the interface , nothing
else.
Types of Data Structures
A data structure is linear when all the elements are arranged in
a linear order or sequential order. If the elements of a data
structure are arranged to have only one predecessor and one
successor, then we can say that -- that data structures are a
linear data structure. We have a non-linear data structure, we
have static data structures and dynamic data structures. In
these type of data structures the memory is allocated at
compile time. The advantage of such data structure is that we
can access data very fast. But on the other hand, disadvantage
is that insertion and deletion operations are slower. We will
discuss this later that how linked list can be created. The linked
list is the best example of a dynamic data structure.
Basics of Asymptotic Analysis (Part 1)
A data structure is the organization of the data in a way so
that it can be used efficiently. We want to use our data
efficiently. And we want to perform some operations on it.
For this purpose, we are using the data structure which is
efficient in terms of storing the data. An ideal data structure
could be the one that takes the least possible time for all its
operations and consumes the least memory space. An array
is capable of storing 100 elements in a data structure. The
size of the array is not defined. But just think of this that ,
this array is able to store 100 elements. And right now, we
have eight elements in this array. We will shift these
elements towards right so that there should be an empty slot
over here. Then, we can easily add our element at the
beginning of the list. Inserting an element at the beginning
of the list is way faster in the linked list than arrays. Inserting
a data structure is much efficient in adding data in
comparison to the array. In this way, we can compare data
structures and this will ultimately give the idea to select the
best possible data structure for a particular operation.
From this presentation onwards,, we will study a new
subject that is, data structures. and in this
presentation., I will introduce what data structure is
and some real-life examples of data structure. you
can think of a data as quantities,, characters or
symbols on which operations are performed by a
computer.. This is what data is. a data structure
structure is the systematic way to organize data so
that it can be used efficiently.. data structure gives
us the way to structure the data, to appropriately
manage the data. and not only that, we can use it
whenever required in an efficient way.. This is the
reason, why companies are preferring this subject
over other subjects because this is very important
subject.. did you know that stack data structure is
used in implementing Redo and undo feature.. You
know that this is the famous. that this is the famous
feature which we are using many number of times in
our applications.. one such application is Google
Docs,, or power, Point, or microsoft word.. That is
why, it is a very useful data structure for Us. now, let
's discuss some real-life examples of data structures..
The primary goal of Neso Academy is to give quality
education to '' actually, I want to write everyone but
accidentally, I have written ebery instead of every. I
press control Z, this element gets selected and you
know, it will get poped out of the stack and will get
placed within this redo stack. and you can see here.,
stack is our data structure. now, let 's see another
example.. data structures are useful in day to day life
and we using them more frequently, and that is why,
it is so hot in it industry. you can guess that, which
data structure is used to store this information. we
can use graph data structure to store information like
this. and now, you can understand why data
structures are so important..
, DATA STRUCTURES NOTES
Data Types vs. Abstract Data Types
In our journey towards learning data structures , we first
have to understand the difference between data types and
abstract data types. A data type defines a certain domain of
values but also defines what operations are allowed on those
values. In contrast to primitive data types, there is a concept
of user defined data types which is not pre defined in the
language itself. ADTs are like user defined data types which
defines operations on values using functions without
specifying what is there inside the function and how the
operations are performed. Think of ADT as a black box which
hides the inner structure and design of the data type from
the user. There are multiple ways to implement an ADT. A
stack ADT can be implemented using arrays or linked lists.
The program which uses data structure is called a client
program. It has access to the interface only and nothing
inside. The implementation can go on without affecting the
stack program. This is one of the biggest advantages of
using abstract data types.
Abstract data type provides abstraction which means hiding
details from the user and it is very important because user
does n't bother about how that particular thing is
implemented. He just have to use that thing. So, this
separation is required. That 's why abstract data type is very
useful concept.
Data Structure Definition & Advantages
In this presentation, we will discuss the formal definition
of data structures and discuss some of the advantages
of it. A data structure is the organization of the data in a
way so that it can be used efficiently. When I say
efficiently, it means in terms of time as well as space.
ADT tells us what is to be done and data structures tells
us how to do it. But how to know which data structure to
use for a particular ADT? That is the basic question.
Data structure is specified by an ADT. ADT is the
blueprint , while data structure is the implementation.
, DATA STRUCTURES NOTES
Data structure provides a level of abstraction. The client
program does n't have to worry about what is going
inside. It just sees the ADT , just the interface , nothing
else.
Types of Data Structures
A data structure is linear when all the elements are arranged in
a linear order or sequential order. If the elements of a data
structure are arranged to have only one predecessor and one
successor, then we can say that -- that data structures are a
linear data structure. We have a non-linear data structure, we
have static data structures and dynamic data structures. In
these type of data structures the memory is allocated at
compile time. The advantage of such data structure is that we
can access data very fast. But on the other hand, disadvantage
is that insertion and deletion operations are slower. We will
discuss this later that how linked list can be created. The linked
list is the best example of a dynamic data structure.
Basics of Asymptotic Analysis (Part 1)
A data structure is the organization of the data in a way so
that it can be used efficiently. We want to use our data
efficiently. And we want to perform some operations on it.
For this purpose, we are using the data structure which is
efficient in terms of storing the data. An ideal data structure
could be the one that takes the least possible time for all its
operations and consumes the least memory space. An array
is capable of storing 100 elements in a data structure. The
size of the array is not defined. But just think of this that ,
this array is able to store 100 elements. And right now, we
have eight elements in this array. We will shift these
elements towards right so that there should be an empty slot
over here. Then, we can easily add our element at the
beginning of the list. Inserting an element at the beginning
of the list is way faster in the linked list than arrays. Inserting
a data structure is much efficient in adding data in
comparison to the array. In this way, we can compare data
structures and this will ultimately give the idea to select the
best possible data structure for a particular operation.
