SlideShare a Scribd company logo
Data Structures &
Algorithms
Chapter One : Introduction to Data
Structures
Need of Data Structures
Advantages of Data Structures
Data Structure Classification
Operations on data structure
Introduction
Data Structure can be defined as the group of data
elements which provides an efficient way of storing
and organizing data in the computer so that it can be
used efficiently.
Data Structures are widely used in almost every
aspect of Computer Science i.e. Operating System,
Compiler Design, Artificial intelligence, Graphics
and many more.
Introduction
 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
Algorithm
 An algorithm is a procedure having well defined
steps for solving a particular problem. Algorithm is
finite set of logic or instructions, written in order for
accomplish the certain predefined task. It is not the
complete program or code, it is just a solution
(logic) of a problem.
Categories Of Algorithm
The major categories of algorithms are given below:
 Sort: Algorithm developed for sorting the items in certain
order.
 Search: Algorithm developed for searching the items inside
a data structure.
 Delete: Algorithm developed for deleting the existing
element from the data structure.
 Insert: Algorithm developed for inserting an item inside a
data structure.
 Update: Algorithm developed for updating the existing
element inside a data structure.
The performance of algorithm is measured on the
basis of following properties:
 Time complexity: It is a way of representing the
amount of time needed by a program to run to the
completion.
 Space complexity: It is the amount of memory
space required by an algorithm, during a course of
its execution. Space complexity is required in
situations when limited memory is available and for
the multi user system.
Example: Design an algorithm to multiply
the two numbers x and y and display the
result in z.
 Step 1 START
 Step 2 declare three integers x, y & z
 Step 3 define values of x & y
 Step 4 multiply values of x & y
 Step 5 store the output of step 4 in z
 Step 6 print z
 Step 7 STOP
Alternatively the algorithm can be written as ?
 Step 1 START MULTIPLY
 Step 2 get values of x & y
 Step 3 z← x * y
 Step 4 display z
 Step 5 STOP
Exercise
Design an algorithm for a
booking cap app?
Characteristics of an Algorithm
An algorithm must follow the mentioned below
characteristics:
 Input: An algorithm must have 0 or well defined inputs.
 Output: An algorithm must have 1 or well defined outputs,
and should match with the desired output.
 Feasibility: An algorithm must be terminated after the finite
number of steps.
 Independent: An algorithm must have step-by-step
directions which is independent of any programming code.
 Unambiguous: An algorithm must be unambiguous and
clear. Each of their steps and input/outputs must be clear
and lead to only one meaning.

Asymptotic Analysis
In mathematical analysis, asymptotic analysis of
algorithm is a method of defining the mathematical
foundation of its run-time performance. Using the
asymptotic analysis, we can easily conclude about
the average case, best case and worst case scenario
of an algorithm.
Usually the time required by an algorithm
comes under three types:
 Worst case: It defines the input for which
the algorithm takes the huge time.
 Average case: It takes average time for
the program execution.
 Best case: It defines the input for which
the algorithm takes the lowest time.
Asymptotic Notations
The commonly used asymptotic notations
used for calculating the running time
complexity of an algorithm is given below:
 Big oh Notation (Ο) (Worst case )
 Omega Notation (Ω) (Best case )
 Theta Notation (θ) (Average case )
Need of Data Structures
 As applications are getting complexed and
amount of data is increasing day by day, there
may arise the following problems:
 Processor speed: To handle very large
amount of data, high speed processing is
required, but as the data is growing day by day
to the billions of files per entity, processor may
fail to deal with that much amount of data.
Need of Data Structures
 Data Search: Consider an inventory size of
106 items in a store, If our application needs to
search for a particular item, it needs to traverse
106 items every time, results in slowing down
the search process.
 Multiple requests: If thousands of users are
searching the data simultaneously on a web
server, then there are the chances that a very
large server can be failed during that process
Need of Data Structures
 in order to solve the above problems, data
structures are used. Data is organized to form a
data structure in such a way that all items are
not required to be searched and required data
can be searched instantly.
Advantages of Data Structures
 Efficiency: Efficiency of a program depends upon
the choice of data structures. For example: suppose,
we have some data and we need to perform the
search for a particular record. In that case, if we
organize our data in an array, we will have to search
sequentially element by element. hence, using array
may not be very efficient here. There are better data
structures which can make the search process
efficient like binary search tree or hash tables.
Advantages of Data Structures
 Reusability: Data structures are reusable, i.e. once
we have implemented a particular data structure, we
can use it at any other place.
 Abstraction: Data structure is specified by the ADT
which provides a level of abstraction. The client
program uses the data structure through interface
only, without getting into the implementation
details.
Data Structure Classifications
Types Of Data Structure
 Linear Data Structures:
A data structure is called linear if all of its
elements are arranged in the linear order. In
linear data structures, the elements are stored in
non-hierarchical way.
Types of Linear Data Structures are given below:
 Arrays: An array is a collection of similar type
of data items and each data item is called an
element of the array. The data type of the element
may be any valid data type like char, int, float or
double.
Cont…
 The elements of array share the same variable
name but each one carries a different index
number known as subscript. The array can be
one dimensional, two dimensional or
multidimensional.
The individual elements of the array age are:
 age[0], age[1], age[2], age[3],......... age[98],
age[99].
Cont…
 Linked List:
Linked list is a linear data structure which is used to
maintain a list in the memory. It can be seen as the
collection of nodes stored at non-contiguous
memory locations. Each node of the list contains a
pointer to its adjacent node.
 Stack: Stack is a linear list in which insertion and
deletions are allowed only at one end, called top
Cont…
 Queue: Queue is a linear list in which elements
can be inserted only at one end called rear and
deleted only at the other end called front.
Types Of Data Structure
 Non Linear Data Structures:
This data structure does not form a sequence
i.e. each item or element is connected with two
or more other items in a non-linear
arrangement. The data elements are not
arranged in sequential structure.
Non Linear Data Structures:
 Trees: Trees are multilevel data structures with a
hierarchical relationship among its elements known
as nodes. The bottom most nodes in the hierarchy
are called leaf node while the top most node is
called root node. Each node contains pointers to
point adjacent nodes.
 Tree data structure is based on the parent-child
relationship among the nodes. Each node in the tree
can have more than one children except the leaf
nodes whereas each node can have at most one
parent except the root node.
Non Linear Data Structures:
 Graphs: Graphs can be defined as the pictorial
representation of the set of elements (represented
by vertices) connected by the links known as
edges. A graph is different from tree in the sense
that a graph can have cycle while the tree can not
have the one.
Operations on data structure
 Insertion:
Insertion can be defined as the process of adding
the elements to the data structure at any location.
 Deletion:
The process of removing an element from the data
structure is called Deletion. We can delete an
element from the data structure at any random
location.
Operations on data structure
 Searching:
The process of finding the location of an
element within the data structure is called
Searching.
There are two algorithms to perform
searching, Linear Search and Binary
Search. We will discuss each one of them
later .
Operations on data structure
 Sorting: The process of arranging the data
structure in a specific order is known as Sorting.
There are many algorithms that can be used to
perform sorting, for example, insertion sort,
selection sort, bubble sort, etc.
 Merging:
When two lists List A and List B of size M and N
respectively, of similar type of elements, clubbed
or joined to produce the third list, List C of size
(M+N), then this process is called merging
Assignment1
1 Define data structures. Give some examples.
2 Discuss the applications of data structures.
3 Write a short note on different operations that
can be performed on data structures.
4 Compare a linked list with and array.
5 Discuss the best case, worst case, average
case, time complexity of an algorithm.
END

More Related Content

PPTX
Data Structure and Algorithms
iqbalphy1
 
PPT
DATA STRUCTURE AND ALGORITHMS
removed_8057d320f6c8601c14a895598b86eacb
 
PPT
Data Structures and Algorithm Analysis
Mary Margarat
 
PPT
Introduction to data structure
adeel hamid
 
PPT
Data Structure and Algorithms
ManishPrajapati78
 
PPTX
Data Structure and Algorithms
Sumathi MathanMohan
 
PPTX
Data structure and algorithm
Trupti Agrawal
 
PPTX
Introduction to data structure and algorithms
Research Scholar in Manonmaniam Sundaranar University
 
Data Structure and Algorithms
iqbalphy1
 
DATA STRUCTURE AND ALGORITHMS
removed_8057d320f6c8601c14a895598b86eacb
 
Data Structures and Algorithm Analysis
Mary Margarat
 
Introduction to data structure
adeel hamid
 
Data Structure and Algorithms
ManishPrajapati78
 
Data Structure and Algorithms
Sumathi MathanMohan
 
Data structure and algorithm
Trupti Agrawal
 
Introduction to data structure and algorithms
Research Scholar in Manonmaniam Sundaranar University
 

What's hot (20)

PPSX
Data Structure (Queue)
Adam Mukharil Bachtiar
 
PPT
Data structure lecture 1
Kumar
 
PPT
Lecture 1 data structures and algorithms
Aakash deep Singhal
 
PPTX
Linked list in Data Structure and Algorithm
KristinaBorooah
 
PPT
Elementary data organisation
Muzamil Hussain
 
PPTX
Integrity Constraints
madhav bansal
 
PPT
Linked lists
SARITHA REDDY
 
PPTX
Linked List
Ashim Lamichhane
 
PDF
Algorithms Lecture 2: Analysis of Algorithms I
Mohamed Loey
 
PPTX
Searching and sorting
PoojithaBollikonda
 
PPTX
class and objects
Payel Guria
 
PPTX
Functional dependencies and normalization
daxesh chauhan
 
PPTX
linked list in data structure
shameen khan
 
PPTX
heap Sort Algorithm
Lemia Algmri
 
PDF
C++ Files and Streams
Ahmed Farag
 
PPTX
File handling in Python
Megha V
 
PPSX
Functional dependency
Dashani Rajapaksha
 
PDF
Python recursion
Prof. Dr. K. Adisesha
 
PPTX
Asymptotic Notation
Protap Mondal
 
PPTX
Interface in java
PhD Research Scholar
 
Data Structure (Queue)
Adam Mukharil Bachtiar
 
Data structure lecture 1
Kumar
 
Lecture 1 data structures and algorithms
Aakash deep Singhal
 
Linked list in Data Structure and Algorithm
KristinaBorooah
 
Elementary data organisation
Muzamil Hussain
 
Integrity Constraints
madhav bansal
 
Linked lists
SARITHA REDDY
 
Linked List
Ashim Lamichhane
 
Algorithms Lecture 2: Analysis of Algorithms I
Mohamed Loey
 
Searching and sorting
PoojithaBollikonda
 
class and objects
Payel Guria
 
Functional dependencies and normalization
daxesh chauhan
 
linked list in data structure
shameen khan
 
heap Sort Algorithm
Lemia Algmri
 
C++ Files and Streams
Ahmed Farag
 
File handling in Python
Megha V
 
Functional dependency
Dashani Rajapaksha
 
Python recursion
Prof. Dr. K. Adisesha
 
Asymptotic Notation
Protap Mondal
 
Interface in java
PhD Research Scholar
 
Ad

Similar to Chapter 1 Introduction to Data Structures and Algorithms.pdf (20)

PPTX
project on data structures and algorithm
AnujKumar566766
 
PDF
Unit 1 OF DS FOR AI DS BTRCH OF DS FOR AI DS BTRCH .pdf
prathamsingh33
 
PDF
U nit i data structure-converted
Shri Shankaracharya College, Bhilai,Junwani
 
DOCX
3rd-Sem_CSE_Data-Structures and Applications.docx
harshavardhan543715
 
PPTX
Data Structures and Algorithm - Module 1.pptx
EllenGrace9
 
PDF
Unit I Data structure and algorithms notes
FIONACHATOLA
 
DOCX
Data structure and algorithm.
Abdul salam
 
PPTX
Lecture 1 and 2
SaheedTundeZubairSTA
 
PPT
Chapter 1( intro & overview)
MUHAMMAD AAMIR
 
PPT
Introduction of C++ Text book UNIT-1 .ppt
akulaaruna81
 
PPTX
Introduction to data structures and its types
sonalishinge2015
 
PPTX
Intro to Data Structure & Algorithms
Akhil Kaushik
 
PDF
Unit-I PPT hususi sisooshsgv. Eijeieieooekejj
sanketkurve7
 
PPTX
DSA.pptx based on basic dsa concepts for engineers
SaketKumar846792
 
PPTX
Data_structures_and_algorithm_Lec_1.pptx
aamirali1061a
 
PPTX
Data_structures_and_algorithm_Lec_1.pptx
aamirali1061a
 
PPTX
19. Data Structures and Algorithm Complexity
Intro C# Book
 
PPTX
Chapter 1 Data structure _Algorithms.pptx
BifaHirpo1
 
PPTX
MD AZAM CA-1-1.pptx
MyMovies15
 
PPTX
1-Introduction to Data Structures beginner.pptx
231b209
 
project on data structures and algorithm
AnujKumar566766
 
Unit 1 OF DS FOR AI DS BTRCH OF DS FOR AI DS BTRCH .pdf
prathamsingh33
 
U nit i data structure-converted
Shri Shankaracharya College, Bhilai,Junwani
 
3rd-Sem_CSE_Data-Structures and Applications.docx
harshavardhan543715
 
Data Structures and Algorithm - Module 1.pptx
EllenGrace9
 
Unit I Data structure and algorithms notes
FIONACHATOLA
 
Data structure and algorithm.
Abdul salam
 
Lecture 1 and 2
SaheedTundeZubairSTA
 
Chapter 1( intro & overview)
MUHAMMAD AAMIR
 
Introduction of C++ Text book UNIT-1 .ppt
akulaaruna81
 
Introduction to data structures and its types
sonalishinge2015
 
Intro to Data Structure & Algorithms
Akhil Kaushik
 
Unit-I PPT hususi sisooshsgv. Eijeieieooekejj
sanketkurve7
 
DSA.pptx based on basic dsa concepts for engineers
SaketKumar846792
 
Data_structures_and_algorithm_Lec_1.pptx
aamirali1061a
 
Data_structures_and_algorithm_Lec_1.pptx
aamirali1061a
 
19. Data Structures and Algorithm Complexity
Intro C# Book
 
Chapter 1 Data structure _Algorithms.pptx
BifaHirpo1
 
MD AZAM CA-1-1.pptx
MyMovies15
 
1-Introduction to Data Structures beginner.pptx
231b209
 
Ad

Recently uploaded (20)

PDF
Health-The-Ultimate-Treasure (1).pdf/8th class science curiosity /samyans edu...
Sandeep Swamy
 
PPTX
Kanban Cards _ Mass Action in Odoo 18.2 - Odoo Slides
Celine George
 
PPTX
HISTORY COLLECTION FOR PSYCHIATRIC PATIENTS.pptx
PoojaSen20
 
PPTX
CDH. pptx
AneetaSharma15
 
PPTX
Odoo 18 Sales_ Managing Quotation Validity
Celine George
 
PPTX
How to Manage Leads in Odoo 18 CRM - Odoo Slides
Celine George
 
PPTX
family health care settings home visit - unit 6 - chn 1 - gnm 1st year.pptx
Priyanshu Anand
 
PPTX
CONCEPT OF CHILD CARE. pptx
AneetaSharma15
 
PDF
1.Natural-Resources-and-Their-Use.ppt pdf /8th class social science Exploring...
Sandeep Swamy
 
PDF
The Picture of Dorian Gray summary and depiction
opaliyahemel
 
PDF
Presentation of the MIPLM subject matter expert Erdem Kaya
MIPLM
 
PPTX
FSSAI (Food Safety and Standards Authority of India) & FDA (Food and Drug Adm...
Dr. Paindla Jyothirmai
 
PDF
RA 12028_ARAL_Orientation_Day-2-Sessions_v2.pdf
Seven De Los Reyes
 
PPTX
Python-Application-in-Drug-Design by R D Jawarkar.pptx
Rahul Jawarkar
 
PDF
What is CFA?? Complete Guide to the Chartered Financial Analyst Program
sp4989653
 
PPTX
Autodock-for-Beginners by Rahul D Jawarkar.pptx
Rahul Jawarkar
 
PDF
Antianginal agents, Definition, Classification, MOA.pdf
Prerana Jadhav
 
DOCX
Action Plan_ARAL PROGRAM_ STAND ALONE SHS.docx
Levenmartlacuna1
 
PPTX
PPTs-The Rise of Empiresghhhhhhhh (1).pptx
academysrusti114
 
PPTX
Trends in pediatric nursing .pptx
AneetaSharma15
 
Health-The-Ultimate-Treasure (1).pdf/8th class science curiosity /samyans edu...
Sandeep Swamy
 
Kanban Cards _ Mass Action in Odoo 18.2 - Odoo Slides
Celine George
 
HISTORY COLLECTION FOR PSYCHIATRIC PATIENTS.pptx
PoojaSen20
 
CDH. pptx
AneetaSharma15
 
Odoo 18 Sales_ Managing Quotation Validity
Celine George
 
How to Manage Leads in Odoo 18 CRM - Odoo Slides
Celine George
 
family health care settings home visit - unit 6 - chn 1 - gnm 1st year.pptx
Priyanshu Anand
 
CONCEPT OF CHILD CARE. pptx
AneetaSharma15
 
1.Natural-Resources-and-Their-Use.ppt pdf /8th class social science Exploring...
Sandeep Swamy
 
The Picture of Dorian Gray summary and depiction
opaliyahemel
 
Presentation of the MIPLM subject matter expert Erdem Kaya
MIPLM
 
FSSAI (Food Safety and Standards Authority of India) & FDA (Food and Drug Adm...
Dr. Paindla Jyothirmai
 
RA 12028_ARAL_Orientation_Day-2-Sessions_v2.pdf
Seven De Los Reyes
 
Python-Application-in-Drug-Design by R D Jawarkar.pptx
Rahul Jawarkar
 
What is CFA?? Complete Guide to the Chartered Financial Analyst Program
sp4989653
 
Autodock-for-Beginners by Rahul D Jawarkar.pptx
Rahul Jawarkar
 
Antianginal agents, Definition, Classification, MOA.pdf
Prerana Jadhav
 
Action Plan_ARAL PROGRAM_ STAND ALONE SHS.docx
Levenmartlacuna1
 
PPTs-The Rise of Empiresghhhhhhhh (1).pptx
academysrusti114
 
Trends in pediatric nursing .pptx
AneetaSharma15
 

Chapter 1 Introduction to Data Structures and Algorithms.pdf

  • 1. Data Structures & Algorithms Chapter One : Introduction to Data Structures Need of Data Structures Advantages of Data Structures Data Structure Classification Operations on data structure
  • 2. Introduction Data Structure can be defined as the group of data elements which provides an efficient way of storing and organizing data in the computer so that it can be used efficiently. Data Structures are widely used in almost every aspect of Computer Science i.e. Operating System, Compiler Design, Artificial intelligence, Graphics and many more.
  • 3. Introduction  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
  • 4. Algorithm  An algorithm is a procedure having well defined steps for solving a particular problem. Algorithm is finite set of logic or instructions, written in order for accomplish the certain predefined task. It is not the complete program or code, it is just a solution (logic) of a problem.
  • 5. Categories Of Algorithm The major categories of algorithms are given below:  Sort: Algorithm developed for sorting the items in certain order.  Search: Algorithm developed for searching the items inside a data structure.  Delete: Algorithm developed for deleting the existing element from the data structure.  Insert: Algorithm developed for inserting an item inside a data structure.  Update: Algorithm developed for updating the existing element inside a data structure.
  • 6. The performance of algorithm is measured on the basis of following properties:  Time complexity: It is a way of representing the amount of time needed by a program to run to the completion.  Space complexity: It is the amount of memory space required by an algorithm, during a course of its execution. Space complexity is required in situations when limited memory is available and for the multi user system.
  • 7. Example: Design an algorithm to multiply the two numbers x and y and display the result in z.  Step 1 START  Step 2 declare three integers x, y & z  Step 3 define values of x & y  Step 4 multiply values of x & y  Step 5 store the output of step 4 in z  Step 6 print z  Step 7 STOP
  • 8. Alternatively the algorithm can be written as ?  Step 1 START MULTIPLY  Step 2 get values of x & y  Step 3 z← x * y  Step 4 display z  Step 5 STOP
  • 9. Exercise Design an algorithm for a booking cap app?
  • 10. Characteristics of an Algorithm An algorithm must follow the mentioned below characteristics:  Input: An algorithm must have 0 or well defined inputs.  Output: An algorithm must have 1 or well defined outputs, and should match with the desired output.  Feasibility: An algorithm must be terminated after the finite number of steps.  Independent: An algorithm must have step-by-step directions which is independent of any programming code.  Unambiguous: An algorithm must be unambiguous and clear. Each of their steps and input/outputs must be clear and lead to only one meaning. 
  • 11. Asymptotic Analysis In mathematical analysis, asymptotic analysis of algorithm is a method of defining the mathematical foundation of its run-time performance. Using the asymptotic analysis, we can easily conclude about the average case, best case and worst case scenario of an algorithm.
  • 12. Usually the time required by an algorithm comes under three types:  Worst case: It defines the input for which the algorithm takes the huge time.  Average case: It takes average time for the program execution.  Best case: It defines the input for which the algorithm takes the lowest time.
  • 13. Asymptotic Notations The commonly used asymptotic notations used for calculating the running time complexity of an algorithm is given below:  Big oh Notation (Ο) (Worst case )  Omega Notation (Ω) (Best case )  Theta Notation (θ) (Average case )
  • 14. Need of Data Structures  As applications are getting complexed and amount of data is increasing day by day, there may arise the following problems:  Processor speed: To handle very large amount of data, high speed processing is required, but as the data is growing day by day to the billions of files per entity, processor may fail to deal with that much amount of data.
  • 15. Need of Data Structures  Data Search: Consider an inventory size of 106 items in a store, If our application needs to search for a particular item, it needs to traverse 106 items every time, results in slowing down the search process.  Multiple requests: If thousands of users are searching the data simultaneously on a web server, then there are the chances that a very large server can be failed during that process
  • 16. Need of Data Structures  in order to solve the above problems, data structures are used. Data is organized to form a data structure in such a way that all items are not required to be searched and required data can be searched instantly.
  • 17. Advantages of Data Structures  Efficiency: Efficiency of a program depends upon the choice of data structures. For example: suppose, we have some data and we need to perform the search for a particular record. In that case, if we organize our data in an array, we will have to search sequentially element by element. hence, using array may not be very efficient here. There are better data structures which can make the search process efficient like binary search tree or hash tables.
  • 18. Advantages of Data Structures  Reusability: Data structures are reusable, i.e. once we have implemented a particular data structure, we can use it at any other place.  Abstraction: Data structure is specified by the ADT which provides a level of abstraction. The client program uses the data structure through interface only, without getting into the implementation details.
  • 20. Types Of Data Structure  Linear Data Structures: A data structure is called linear if all of its elements are arranged in the linear order. In linear data structures, the elements are stored in non-hierarchical way. Types of Linear Data Structures are given below:  Arrays: An array is a collection of similar type of data items and each data item is called an element of the array. The data type of the element may be any valid data type like char, int, float or double.
  • 21. Cont…  The elements of array share the same variable name but each one carries a different index number known as subscript. The array can be one dimensional, two dimensional or multidimensional. The individual elements of the array age are:  age[0], age[1], age[2], age[3],......... age[98], age[99].
  • 22. Cont…  Linked List: Linked list is a linear data structure which is used to maintain a list in the memory. It can be seen as the collection of nodes stored at non-contiguous memory locations. Each node of the list contains a pointer to its adjacent node.  Stack: Stack is a linear list in which insertion and deletions are allowed only at one end, called top
  • 23. Cont…  Queue: Queue is a linear list in which elements can be inserted only at one end called rear and deleted only at the other end called front.
  • 24. Types Of Data Structure  Non Linear Data Structures: This data structure does not form a sequence i.e. each item or element is connected with two or more other items in a non-linear arrangement. The data elements are not arranged in sequential structure.
  • 25. Non Linear Data Structures:  Trees: Trees are multilevel data structures with a hierarchical relationship among its elements known as nodes. The bottom most nodes in the hierarchy are called leaf node while the top most node is called root node. Each node contains pointers to point adjacent nodes.  Tree data structure is based on the parent-child relationship among the nodes. Each node in the tree can have more than one children except the leaf nodes whereas each node can have at most one parent except the root node.
  • 26. Non Linear Data Structures:  Graphs: Graphs can be defined as the pictorial representation of the set of elements (represented by vertices) connected by the links known as edges. A graph is different from tree in the sense that a graph can have cycle while the tree can not have the one.
  • 27. Operations on data structure  Insertion: Insertion can be defined as the process of adding the elements to the data structure at any location.  Deletion: The process of removing an element from the data structure is called Deletion. We can delete an element from the data structure at any random location.
  • 28. Operations on data structure  Searching: The process of finding the location of an element within the data structure is called Searching. There are two algorithms to perform searching, Linear Search and Binary Search. We will discuss each one of them later .
  • 29. Operations on data structure  Sorting: The process of arranging the data structure in a specific order is known as Sorting. There are many algorithms that can be used to perform sorting, for example, insertion sort, selection sort, bubble sort, etc.  Merging: When two lists List A and List B of size M and N respectively, of similar type of elements, clubbed or joined to produce the third list, List C of size (M+N), then this process is called merging
  • 30. Assignment1 1 Define data structures. Give some examples. 2 Discuss the applications of data structures. 3 Write a short note on different operations that can be performed on data structures. 4 Compare a linked list with and array. 5 Discuss the best case, worst case, average case, time complexity of an algorithm.
  • 31. END