9/18/24, 1:39 Data Structures full
PM notes
DATA STRUCTURES
UNIT I
Data structure is a particular way of organizing data in a computer so that it
can be used effectively.
Data Structures are widely used in almost every aspect of Computer Science i.e.
Operating System, Compiler Design, Artificial intelligence, Graphics and many
more.
Data Structures are the main part of many computer science algorithms as they
enable the programmers to handle the data in an efficient way. It plays a vital
role in enhancing the performance of a software or a program as the main
function of the software is to store and retrieve the user's data as fast as possible
Example of data structures
1. Arrays
An array is a structure of fixed-size, which can hold items of the same
data type. It can be an array of integers, an array of floating-point
numbers, an array of strings or even an array of arrays (such as 2-
dimensional arrays). Arrays are indexed, meaning that random access is
possible.
2. Linked Lists
A linked list is a sequential structure that consists of a sequence of
items in linear order which are linked to each other. Hence, you have to
access data sequentially and random access is not possible.
about:blan 1/90
k
,9/18/24, 1:39 Data Structures full
PM notes
3. Stacks
A stack is a LIFO (Last In First Out 4 the element placed at last can
be accessed at first) structure which can be commonly found in many
programming languages. This structure is named as 5stack” because it
resembles a real-world stack 4 a stack of plates.
4. Queues
A queue is a FIFO (First In First Out 4 the element placed at first can
be accessed at first) structure which can be commonly found in many
programming languages. This structure is named as 5queue” because
it resembles a real-world queue 4 people waiting in a queue.
5. Trees
A tree is a hierarchical structure where data is organized hierarchically
and are linked together. This structure is different than a linked list
whereas, in a linked list, items are linked in a linear order.
6. Graphs
A graph consists of a finite set of vertices or nodes and a set
of edges connecting these vertices.
Elementary Data Organization
Data: Data can be defined as an elementary value, for example, student's name
and his roll number are the data about the student.
Group Items: Data items which have subordinate data items are called Group
item, for example, name of a student can have first name and the last name.
about:blan 2/90
k
,9/18/24, 1:39 Data Structures full
PM notes
about:blan 3/90
k
, 9/18/24, 1:39 Data Structures full
PM notes
Examples: int, float, double Examples: stacks, queues, tree
Categories of data structure
Data structures can be classified as follows
Primitive Data Structures
These are the structures which are supported at the machine level, they can be
used to make non-primitive data structures. These are integral and are pure in
form. They have predefined behavior and specifications.
Examples: Integer, float, character etc
about:blan 4/90
k
PM notes
DATA STRUCTURES
UNIT I
Data structure is a particular way of organizing data in a computer so that it
can be used effectively.
Data Structures are widely used in almost every aspect of Computer Science i.e.
Operating System, Compiler Design, Artificial intelligence, Graphics and many
more.
Data Structures are the main part of many computer science algorithms as they
enable the programmers to handle the data in an efficient way. It plays a vital
role in enhancing the performance of a software or a program as the main
function of the software is to store and retrieve the user's data as fast as possible
Example of data structures
1. Arrays
An array is a structure of fixed-size, which can hold items of the same
data type. It can be an array of integers, an array of floating-point
numbers, an array of strings or even an array of arrays (such as 2-
dimensional arrays). Arrays are indexed, meaning that random access is
possible.
2. Linked Lists
A linked list is a sequential structure that consists of a sequence of
items in linear order which are linked to each other. Hence, you have to
access data sequentially and random access is not possible.
about:blan 1/90
k
,9/18/24, 1:39 Data Structures full
PM notes
3. Stacks
A stack is a LIFO (Last In First Out 4 the element placed at last can
be accessed at first) structure which can be commonly found in many
programming languages. This structure is named as 5stack” because it
resembles a real-world stack 4 a stack of plates.
4. Queues
A queue is a FIFO (First In First Out 4 the element placed at first can
be accessed at first) structure which can be commonly found in many
programming languages. This structure is named as 5queue” because
it resembles a real-world queue 4 people waiting in a queue.
5. Trees
A tree is a hierarchical structure where data is organized hierarchically
and are linked together. This structure is different than a linked list
whereas, in a linked list, items are linked in a linear order.
6. Graphs
A graph consists of a finite set of vertices or nodes and a set
of edges connecting these vertices.
Elementary Data Organization
Data: Data can be defined as an elementary value, for example, student's name
and his roll number are the data about the student.
Group Items: Data items which have subordinate data items are called Group
item, for example, name of a student can have first name and the last name.
about:blan 2/90
k
,9/18/24, 1:39 Data Structures full
PM notes
about:blan 3/90
k
, 9/18/24, 1:39 Data Structures full
PM notes
Examples: int, float, double Examples: stacks, queues, tree
Categories of data structure
Data structures can be classified as follows
Primitive Data Structures
These are the structures which are supported at the machine level, they can be
used to make non-primitive data structures. These are integral and are pure in
form. They have predefined behavior and specifications.
Examples: Integer, float, character etc
about:blan 4/90
k
