SlideShare a Scribd company logo
1 of 25
Introduction to
Data Structure
What is Data Structure?
 A data structure is a particular way of
storing and organizing data in a computer
so that it can be used efficiently.
 They provide a means to manage large
amounts of data efficiently, such as large
databases.
 Data are simply values or set of values
and Database is organized collection of
data.
Department of CSE 2
What is Data Structure? (…contd)
A data structure is a logical and
mathematical model of a particular
organization of data.
The choice of particular data structure
depends upon following consideration:
1.It must be able to represent the inherent
relationship of data in the real world.
2.It must be simple enough so that it can be
processed efficiently as and when
necessary.
Department of CSE 3
THE STUDY OF DATA
STRUCTURE INCLUDE:
 Logical description of data structure
 Implementation of data structure
 Quantitative analysis of data structure, this include
amount of memory, processing time
Department of CSE 4
Classification of Data Structure
Data Structures
Department of CSE 5
Primitive Data Structures Non-Primitive Data Structures
Integer Real Character Boolean Linear Data
Structures
Non -Linear
Data Structures
Arrays
Stack
sLinked
List
Queues
Trees
Graphs
Classification (contd..)
A data structure can be broadly classified into
 Primitive data structure
 Non-primitive data structure
Primitive data structure :-The data structures, that are
directly operated upon by machine level instructions i.e.
the fundamental data types such as int, float in case of
‘c’ are known as primitive data structures.
Non- Primitive data structure :-These are more complex
data structures. These data structures are derived from
the primitive data structures.
Department of CSE 6
Classification (contd..)
Non-Primitive Data Structures can be further divided into
two categories:
 Linear Data Structures
 Non-Linear Data Structures.
Linear Data Structures:-In linear data structures, data
elements are organized sequentially and therefore they
are easy to implement in the computer’s memory. E.g.
Arrays.
 Non-Linear Data Structures:-In nonlinear data
structures, a data element can be attached to several
other data elements to represent specific relationships
that exist among them. E.g. Graphs
Department of CSE 7
Array & Linked List
Department of CSE 8
[0] [1] [2]
A B CArray
linked
A B CLinked list
Linked lists are unbounded
(maximum number of items limited only by memory)
node
Stack
 Stack
◦ New nodes can be added and removed only at the top
◦ Similar to a pile of dishes
◦ Last-in, first-out (LIFO)
 push
◦ Adds a new node to the top of the stack
 pop
◦ Removes a node from the top
Department of CSE 9
Stack
 A stack is a list in which insertion and
deletion take place at the same end
◦ This end is called top
◦ The other end is called bottom.
Department of CSE 10
Queue
 Queue
◦ Similar to a supermarket checkout line
◦ First-in, first-out (FIFO)
◦ Nodes are removed only from the head
◦ Nodes are inserted only at the tail
 Insert and remove operations
◦ Enqueue (insert) and dequeue (remove)
Department of CSE 11
The Queue Operations
 A queue is like a
line of people
waiting for a bank
teller. The queue
has a front and a
rear.
Department of CSE 12
$ $
Front(Removal)Rear(insertion)
Walking out
Tree
A tree T is a finite non empty set of
elements. One of these elements is called
the root, and the remaining elements, if
any, are portioned into trees, which are
called the sub trees of T.
Department of CSE 13
Tree (example)
Department of CSE 14
node
Graph
 A graph is defined as:
“Graph G is a ordered set (V,E), where V(G)
represent the set of elements, called vertices, and
E(G) represents the edges between these
vertices.”
 Graphs can be
◦ Undirected
◦ Directed
Department of CSE 15
Graph
Figure shows a sample graph
V(G)={v1,v2,v3,v4,v5}
E(G)={e1,e2,e3,e4,e5}
Department of CSE 16
v1
v5
v4
v2 v3
e2
e1
e5
e4
e3
Fig . (a) Undirected Graph
Graph
Department of CSE 17
v1
v5
v4
v2 v3
e2
e1
e5
e4
e3
Fig. (b) Directed Graph
In directed graph, an edge is represented by an ordered pair (u,v) (i.e.=(u,v)),
that can be traversed only from u toward v.
Data Structure Operations
Five major operations are associated with all data
structures.
i. Creation:- Initialization of the beginning.
ii. Insertion: - Insertion means adding new details
or new node into the data structure.
iii. Deletion: - Deletion means removing a node
from the data structure.
iv. Traversal: - Traversing means accessing each
node exactly once so that the nodes of a data
structure can be processed. Traversing is also
called as visiting.
v. Searching: - Searching means finding the
location of node for a given key value.
Department of CSE 18
Data Structure Operations(contd..)
 Apart from the four operations mentioned
above, there are two more operations
occasionally performed on data structures. They
are:
(a) Sorting: -Sorting means arranging the data in
a particular order.
(b) Merging: - Merging means joining two lists.
Department of CSE 19
A first look on ADTs
 Solving a problem involves processing
data, and an important part of the solution
is the efficient organization of the data
 In order to do that, we need to identify:
1. The collection of data items
2. Basic operation that must be performed
on them
Abstract Data Type (ADT)
 The word “abstract” refers to the fact
that the data and the basic operations
defined on it are being studied
independently of how they are
implemented
 We think about what can be done with
the data, not how it is done
Primitive Data Type vs ADT
Department of CSE 22
Some ADT’s
Some user defined ADT’s are
 Stacks
 Queues
Department of CSE 23
Stack ADT
We define a stack as an ADT as shown
below:
Department of CSE 24
Queue ADT
We define a queue as an ADT as shown
below:
Department of CSE 25

More Related Content

What's hot

Introduction to stack
Introduction to stackIntroduction to stack
Introduction to stackvaibhav2910
 
Searching techniques in Data Structure And Algorithm
Searching techniques in Data Structure And AlgorithmSearching techniques in Data Structure And Algorithm
Searching techniques in Data Structure And Algorithm03446940736
 
queue & its applications
queue & its applicationsqueue & its applications
queue & its applicationssomendra kumar
 
linked list in data structure
linked list in data structure linked list in data structure
linked list in data structure shameen khan
 
Binary Search Tree in Data Structure
Binary Search Tree in Data StructureBinary Search Tree in Data Structure
Binary Search Tree in Data StructureDharita Chokshi
 
Searching and Sorting Techniques in Data Structure
Searching and Sorting Techniques in Data StructureSearching and Sorting Techniques in Data Structure
Searching and Sorting Techniques in Data StructureBalwant Gorad
 
sparse matrix in data structure
sparse matrix in data structuresparse matrix in data structure
sparse matrix in data structureMAHALAKSHMI P
 
Data structure - Graph
Data structure - GraphData structure - Graph
Data structure - GraphMadhu Bala
 
Priority queue in DSA
Priority queue in DSAPriority queue in DSA
Priority queue in DSAjunnubabu
 
Introduction to data structures and Algorithm
Introduction to data structures and AlgorithmIntroduction to data structures and Algorithm
Introduction to data structures and AlgorithmDhaval Kaneria
 
Queue in Data Structure
Queue in Data Structure Queue in Data Structure
Queue in Data Structure Janki Shah
 
BCA DATA STRUCTURES LINEAR ARRAYS MRS.SOWMYA JYOTHI
BCA DATA STRUCTURES LINEAR ARRAYS MRS.SOWMYA JYOTHIBCA DATA STRUCTURES LINEAR ARRAYS MRS.SOWMYA JYOTHI
BCA DATA STRUCTURES LINEAR ARRAYS MRS.SOWMYA JYOTHISowmya Jyothi
 
SEARCHING AND SORTING ALGORITHMS
SEARCHING AND SORTING ALGORITHMSSEARCHING AND SORTING ALGORITHMS
SEARCHING AND SORTING ALGORITHMSGokul Hari
 

What's hot (20)

Data structures using c
Data structures using cData structures using c
Data structures using c
 
Introduction to stack
Introduction to stackIntroduction to stack
Introduction to stack
 
Searching techniques in Data Structure And Algorithm
Searching techniques in Data Structure And AlgorithmSearching techniques in Data Structure And Algorithm
Searching techniques in Data Structure And Algorithm
 
single linked list
single linked listsingle linked list
single linked list
 
queue & its applications
queue & its applicationsqueue & its applications
queue & its applications
 
linked list in data structure
linked list in data structure linked list in data structure
linked list in data structure
 
Binary Search Tree in Data Structure
Binary Search Tree in Data StructureBinary Search Tree in Data Structure
Binary Search Tree in Data Structure
 
Searching and Sorting Techniques in Data Structure
Searching and Sorting Techniques in Data StructureSearching and Sorting Techniques in Data Structure
Searching and Sorting Techniques in Data Structure
 
sparse matrix in data structure
sparse matrix in data structuresparse matrix in data structure
sparse matrix in data structure
 
Data structure - Graph
Data structure - GraphData structure - Graph
Data structure - Graph
 
Priority queue in DSA
Priority queue in DSAPriority queue in DSA
Priority queue in DSA
 
Introduction to data structures and Algorithm
Introduction to data structures and AlgorithmIntroduction to data structures and Algorithm
Introduction to data structures and Algorithm
 
Hashing
HashingHashing
Hashing
 
Queue in Data Structure
Queue in Data Structure Queue in Data Structure
Queue in Data Structure
 
Graph traversals in Data Structures
Graph traversals in Data StructuresGraph traversals in Data Structures
Graph traversals in Data Structures
 
BCA DATA STRUCTURES LINEAR ARRAYS MRS.SOWMYA JYOTHI
BCA DATA STRUCTURES LINEAR ARRAYS MRS.SOWMYA JYOTHIBCA DATA STRUCTURES LINEAR ARRAYS MRS.SOWMYA JYOTHI
BCA DATA STRUCTURES LINEAR ARRAYS MRS.SOWMYA JYOTHI
 
SEARCHING AND SORTING ALGORITHMS
SEARCHING AND SORTING ALGORITHMSSEARCHING AND SORTING ALGORITHMS
SEARCHING AND SORTING ALGORITHMS
 
Data structure
Data structureData structure
Data structure
 
Data Structure (Queue)
Data Structure (Queue)Data Structure (Queue)
Data Structure (Queue)
 
Stacks in c++
Stacks in c++Stacks in c++
Stacks in c++
 

Similar to Introduction to data structure ppt

DS Module 1.pptx
DS Module 1.pptxDS Module 1.pptx
DS Module 1.pptxSaralaT3
 
DS Module 1.pptx
DS Module 1.pptxDS Module 1.pptx
DS Module 1.pptxsarala9
 
data structures module I & II.pptx
data structures module I & II.pptxdata structures module I & II.pptx
data structures module I & II.pptxrani marri
 
Data Structures & Recursion-Introduction.pdf
Data Structures & Recursion-Introduction.pdfData Structures & Recursion-Introduction.pdf
Data Structures & Recursion-Introduction.pdfMaryJacob24
 
Data Structures and algoithms Unit - 1.pptx
Data Structures and algoithms Unit - 1.pptxData Structures and algoithms Unit - 1.pptx
Data Structures and algoithms Unit - 1.pptxmexiuro901
 
Unit.1 Introduction to Data Structuresres
Unit.1 Introduction to Data StructuresresUnit.1 Introduction to Data Structuresres
Unit.1 Introduction to Data Structuresresamplopsurat
 
Chapter 1 - Introduction to Data Structure.ppt
Chapter 1 - Introduction to Data Structure.pptChapter 1 - Introduction to Data Structure.ppt
Chapter 1 - Introduction to Data Structure.pptNORSHADILAAHMADBADEL
 
data structure details of types and .ppt
data structure details of types and .pptdata structure details of types and .ppt
data structure details of types and .pptpoonamsngr
 
Datastructures and algorithms prepared by M.V.Brehmanada Reddy
Datastructures and algorithms prepared by M.V.Brehmanada ReddyDatastructures and algorithms prepared by M.V.Brehmanada Reddy
Datastructures and algorithms prepared by M.V.Brehmanada ReddyMalikireddy Bramhananda Reddy
 
Chapter 1 Introduction to Data Structures and Algorithms.pdf
Chapter 1 Introduction to Data Structures and Algorithms.pdfChapter 1 Introduction to Data Structures and Algorithms.pdf
Chapter 1 Introduction to Data Structures and Algorithms.pdfAxmedcarb
 

Similar to Introduction to data structure ppt (20)

DS Module 1.pptx
DS Module 1.pptxDS Module 1.pptx
DS Module 1.pptx
 
DS Module 1.pptx
DS Module 1.pptxDS Module 1.pptx
DS Module 1.pptx
 
data structures module I & II.pptx
data structures module I & II.pptxdata structures module I & II.pptx
data structures module I & II.pptx
 
Chapter 1
Chapter 1Chapter 1
Chapter 1
 
Ch1
Ch1Ch1
Ch1
 
1597380885789.ppt
1597380885789.ppt1597380885789.ppt
1597380885789.ppt
 
Data Structures & Recursion-Introduction.pdf
Data Structures & Recursion-Introduction.pdfData Structures & Recursion-Introduction.pdf
Data Structures & Recursion-Introduction.pdf
 
Data Structures and algoithms Unit - 1.pptx
Data Structures and algoithms Unit - 1.pptxData Structures and algoithms Unit - 1.pptx
Data Structures and algoithms Unit - 1.pptx
 
DSA - Copy.pptx
DSA - Copy.pptxDSA - Copy.pptx
DSA - Copy.pptx
 
Unit.1 Introduction to Data Structuresres
Unit.1 Introduction to Data StructuresresUnit.1 Introduction to Data Structuresres
Unit.1 Introduction to Data Structuresres
 
UNIT II.docx
UNIT II.docxUNIT II.docx
UNIT II.docx
 
Data Structure Basics
Data Structure BasicsData Structure Basics
Data Structure Basics
 
Chapter 1 - Introduction to Data Structure.ppt
Chapter 1 - Introduction to Data Structure.pptChapter 1 - Introduction to Data Structure.ppt
Chapter 1 - Introduction to Data Structure.ppt
 
data structure details of types and .ppt
data structure details of types and .pptdata structure details of types and .ppt
data structure details of types and .ppt
 
104333 sri vidhya eng notes
104333 sri vidhya eng notes104333 sri vidhya eng notes
104333 sri vidhya eng notes
 
Datastructures and algorithms prepared by M.V.Brehmanada Reddy
Datastructures and algorithms prepared by M.V.Brehmanada ReddyDatastructures and algorithms prepared by M.V.Brehmanada Reddy
Datastructures and algorithms prepared by M.V.Brehmanada Reddy
 
Chapter 1 Introduction to Data Structures and Algorithms.pdf
Chapter 1 Introduction to Data Structures and Algorithms.pdfChapter 1 Introduction to Data Structures and Algorithms.pdf
Chapter 1 Introduction to Data Structures and Algorithms.pdf
 
PM.ppt
PM.pptPM.ppt
PM.ppt
 
UNITIII LDS.pdf
UNITIII LDS.pdfUNITIII LDS.pdf
UNITIII LDS.pdf
 
PM.ppt
PM.pptPM.ppt
PM.ppt
 

Recently uploaded

Grade 9 Quarter 4 Dll Grade 9 Quarter 4 DLL.pdf
Grade 9 Quarter 4 Dll Grade 9 Quarter 4 DLL.pdfGrade 9 Quarter 4 Dll Grade 9 Quarter 4 DLL.pdf
Grade 9 Quarter 4 Dll Grade 9 Quarter 4 DLL.pdfJemuel Francisco
 
Student Profile Sample - We help schools to connect the data they have, with ...
Student Profile Sample - We help schools to connect the data they have, with ...Student Profile Sample - We help schools to connect the data they have, with ...
Student Profile Sample - We help schools to connect the data they have, with ...Seán Kennedy
 
Visit to a blind student's school🧑‍🦯🧑‍🦯(community medicine)
Visit to a blind student's school🧑‍🦯🧑‍🦯(community medicine)Visit to a blind student's school🧑‍🦯🧑‍🦯(community medicine)
Visit to a blind student's school🧑‍🦯🧑‍🦯(community medicine)lakshayb543
 
How to Add Barcode on PDF Report in Odoo 17
How to Add Barcode on PDF Report in Odoo 17How to Add Barcode on PDF Report in Odoo 17
How to Add Barcode on PDF Report in Odoo 17Celine George
 
GRADE 4 - SUMMATIVE TEST QUARTER 4 ALL SUBJECTS
GRADE 4 - SUMMATIVE TEST QUARTER 4 ALL SUBJECTSGRADE 4 - SUMMATIVE TEST QUARTER 4 ALL SUBJECTS
GRADE 4 - SUMMATIVE TEST QUARTER 4 ALL SUBJECTSJoshuaGantuangco2
 
ANG SEKTOR NG agrikultura.pptx QUARTER 4
ANG SEKTOR NG agrikultura.pptx QUARTER 4ANG SEKTOR NG agrikultura.pptx QUARTER 4
ANG SEKTOR NG agrikultura.pptx QUARTER 4MiaBumagat1
 
ECONOMIC CONTEXT - PAPER 1 Q3: NEWSPAPERS.pptx
ECONOMIC CONTEXT - PAPER 1 Q3: NEWSPAPERS.pptxECONOMIC CONTEXT - PAPER 1 Q3: NEWSPAPERS.pptx
ECONOMIC CONTEXT - PAPER 1 Q3: NEWSPAPERS.pptxiammrhaywood
 
USPS® Forced Meter Migration - How to Know if Your Postage Meter Will Soon be...
USPS® Forced Meter Migration - How to Know if Your Postage Meter Will Soon be...USPS® Forced Meter Migration - How to Know if Your Postage Meter Will Soon be...
USPS® Forced Meter Migration - How to Know if Your Postage Meter Will Soon be...Postal Advocate Inc.
 
4.18.24 Movement Legacies, Reflection, and Review.pptx
4.18.24 Movement Legacies, Reflection, and Review.pptx4.18.24 Movement Legacies, Reflection, and Review.pptx
4.18.24 Movement Legacies, Reflection, and Review.pptxmary850239
 
Global Lehigh Strategic Initiatives (without descriptions)
Global Lehigh Strategic Initiatives (without descriptions)Global Lehigh Strategic Initiatives (without descriptions)
Global Lehigh Strategic Initiatives (without descriptions)cama23
 
Incoming and Outgoing Shipments in 3 STEPS Using Odoo 17
Incoming and Outgoing Shipments in 3 STEPS Using Odoo 17Incoming and Outgoing Shipments in 3 STEPS Using Odoo 17
Incoming and Outgoing Shipments in 3 STEPS Using Odoo 17Celine George
 
Field Attribute Index Feature in Odoo 17
Field Attribute Index Feature in Odoo 17Field Attribute Index Feature in Odoo 17
Field Attribute Index Feature in Odoo 17Celine George
 
Keynote by Prof. Wurzer at Nordex about IP-design
Keynote by Prof. Wurzer at Nordex about IP-designKeynote by Prof. Wurzer at Nordex about IP-design
Keynote by Prof. Wurzer at Nordex about IP-designMIPLM
 
Inclusivity Essentials_ Creating Accessible Websites for Nonprofits .pdf
Inclusivity Essentials_ Creating Accessible Websites for Nonprofits .pdfInclusivity Essentials_ Creating Accessible Websites for Nonprofits .pdf
Inclusivity Essentials_ Creating Accessible Websites for Nonprofits .pdfTechSoup
 
ICS2208 Lecture6 Notes for SL spaces.pdf
ICS2208 Lecture6 Notes for SL spaces.pdfICS2208 Lecture6 Notes for SL spaces.pdf
ICS2208 Lecture6 Notes for SL spaces.pdfVanessa Camilleri
 
Active Learning Strategies (in short ALS).pdf
Active Learning Strategies (in short ALS).pdfActive Learning Strategies (in short ALS).pdf
Active Learning Strategies (in short ALS).pdfPatidar M
 
What is Model Inheritance in Odoo 17 ERP
What is Model Inheritance in Odoo 17 ERPWhat is Model Inheritance in Odoo 17 ERP
What is Model Inheritance in Odoo 17 ERPCeline George
 
Difference Between Search & Browse Methods in Odoo 17
Difference Between Search & Browse Methods in Odoo 17Difference Between Search & Browse Methods in Odoo 17
Difference Between Search & Browse Methods in Odoo 17Celine George
 

Recently uploaded (20)

Grade 9 Quarter 4 Dll Grade 9 Quarter 4 DLL.pdf
Grade 9 Quarter 4 Dll Grade 9 Quarter 4 DLL.pdfGrade 9 Quarter 4 Dll Grade 9 Quarter 4 DLL.pdf
Grade 9 Quarter 4 Dll Grade 9 Quarter 4 DLL.pdf
 
Student Profile Sample - We help schools to connect the data they have, with ...
Student Profile Sample - We help schools to connect the data they have, with ...Student Profile Sample - We help schools to connect the data they have, with ...
Student Profile Sample - We help schools to connect the data they have, with ...
 
Visit to a blind student's school🧑‍🦯🧑‍🦯(community medicine)
Visit to a blind student's school🧑‍🦯🧑‍🦯(community medicine)Visit to a blind student's school🧑‍🦯🧑‍🦯(community medicine)
Visit to a blind student's school🧑‍🦯🧑‍🦯(community medicine)
 
How to Add Barcode on PDF Report in Odoo 17
How to Add Barcode on PDF Report in Odoo 17How to Add Barcode on PDF Report in Odoo 17
How to Add Barcode on PDF Report in Odoo 17
 
GRADE 4 - SUMMATIVE TEST QUARTER 4 ALL SUBJECTS
GRADE 4 - SUMMATIVE TEST QUARTER 4 ALL SUBJECTSGRADE 4 - SUMMATIVE TEST QUARTER 4 ALL SUBJECTS
GRADE 4 - SUMMATIVE TEST QUARTER 4 ALL SUBJECTS
 
ANG SEKTOR NG agrikultura.pptx QUARTER 4
ANG SEKTOR NG agrikultura.pptx QUARTER 4ANG SEKTOR NG agrikultura.pptx QUARTER 4
ANG SEKTOR NG agrikultura.pptx QUARTER 4
 
ECONOMIC CONTEXT - PAPER 1 Q3: NEWSPAPERS.pptx
ECONOMIC CONTEXT - PAPER 1 Q3: NEWSPAPERS.pptxECONOMIC CONTEXT - PAPER 1 Q3: NEWSPAPERS.pptx
ECONOMIC CONTEXT - PAPER 1 Q3: NEWSPAPERS.pptx
 
Raw materials used in Herbal Cosmetics.pptx
Raw materials used in Herbal Cosmetics.pptxRaw materials used in Herbal Cosmetics.pptx
Raw materials used in Herbal Cosmetics.pptx
 
USPS® Forced Meter Migration - How to Know if Your Postage Meter Will Soon be...
USPS® Forced Meter Migration - How to Know if Your Postage Meter Will Soon be...USPS® Forced Meter Migration - How to Know if Your Postage Meter Will Soon be...
USPS® Forced Meter Migration - How to Know if Your Postage Meter Will Soon be...
 
4.18.24 Movement Legacies, Reflection, and Review.pptx
4.18.24 Movement Legacies, Reflection, and Review.pptx4.18.24 Movement Legacies, Reflection, and Review.pptx
4.18.24 Movement Legacies, Reflection, and Review.pptx
 
YOUVE GOT EMAIL_FINALS_EL_DORADO_2024.pptx
YOUVE GOT EMAIL_FINALS_EL_DORADO_2024.pptxYOUVE GOT EMAIL_FINALS_EL_DORADO_2024.pptx
YOUVE GOT EMAIL_FINALS_EL_DORADO_2024.pptx
 
Global Lehigh Strategic Initiatives (without descriptions)
Global Lehigh Strategic Initiatives (without descriptions)Global Lehigh Strategic Initiatives (without descriptions)
Global Lehigh Strategic Initiatives (without descriptions)
 
Incoming and Outgoing Shipments in 3 STEPS Using Odoo 17
Incoming and Outgoing Shipments in 3 STEPS Using Odoo 17Incoming and Outgoing Shipments in 3 STEPS Using Odoo 17
Incoming and Outgoing Shipments in 3 STEPS Using Odoo 17
 
Field Attribute Index Feature in Odoo 17
Field Attribute Index Feature in Odoo 17Field Attribute Index Feature in Odoo 17
Field Attribute Index Feature in Odoo 17
 
Keynote by Prof. Wurzer at Nordex about IP-design
Keynote by Prof. Wurzer at Nordex about IP-designKeynote by Prof. Wurzer at Nordex about IP-design
Keynote by Prof. Wurzer at Nordex about IP-design
 
Inclusivity Essentials_ Creating Accessible Websites for Nonprofits .pdf
Inclusivity Essentials_ Creating Accessible Websites for Nonprofits .pdfInclusivity Essentials_ Creating Accessible Websites for Nonprofits .pdf
Inclusivity Essentials_ Creating Accessible Websites for Nonprofits .pdf
 
ICS2208 Lecture6 Notes for SL spaces.pdf
ICS2208 Lecture6 Notes for SL spaces.pdfICS2208 Lecture6 Notes for SL spaces.pdf
ICS2208 Lecture6 Notes for SL spaces.pdf
 
Active Learning Strategies (in short ALS).pdf
Active Learning Strategies (in short ALS).pdfActive Learning Strategies (in short ALS).pdf
Active Learning Strategies (in short ALS).pdf
 
What is Model Inheritance in Odoo 17 ERP
What is Model Inheritance in Odoo 17 ERPWhat is Model Inheritance in Odoo 17 ERP
What is Model Inheritance in Odoo 17 ERP
 
Difference Between Search & Browse Methods in Odoo 17
Difference Between Search & Browse Methods in Odoo 17Difference Between Search & Browse Methods in Odoo 17
Difference Between Search & Browse Methods in Odoo 17
 

Introduction to data structure ppt

  • 2. What is Data Structure?  A data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently.  They provide a means to manage large amounts of data efficiently, such as large databases.  Data are simply values or set of values and Database is organized collection of data. Department of CSE 2
  • 3. What is Data Structure? (…contd) A data structure is a logical and mathematical model of a particular organization of data. The choice of particular data structure depends upon following consideration: 1.It must be able to represent the inherent relationship of data in the real world. 2.It must be simple enough so that it can be processed efficiently as and when necessary. Department of CSE 3
  • 4. THE STUDY OF DATA STRUCTURE INCLUDE:  Logical description of data structure  Implementation of data structure  Quantitative analysis of data structure, this include amount of memory, processing time Department of CSE 4
  • 5. Classification of Data Structure Data Structures Department of CSE 5 Primitive Data Structures Non-Primitive Data Structures Integer Real Character Boolean Linear Data Structures Non -Linear Data Structures Arrays Stack sLinked List Queues Trees Graphs
  • 6. Classification (contd..) A data structure can be broadly classified into  Primitive data structure  Non-primitive data structure Primitive data structure :-The data structures, that are directly operated upon by machine level instructions i.e. the fundamental data types such as int, float in case of ‘c’ are known as primitive data structures. Non- Primitive data structure :-These are more complex data structures. These data structures are derived from the primitive data structures. Department of CSE 6
  • 7. Classification (contd..) Non-Primitive Data Structures can be further divided into two categories:  Linear Data Structures  Non-Linear Data Structures. Linear Data Structures:-In linear data structures, data elements are organized sequentially and therefore they are easy to implement in the computer’s memory. E.g. Arrays.  Non-Linear Data Structures:-In nonlinear data structures, a data element can be attached to several other data elements to represent specific relationships that exist among them. E.g. Graphs Department of CSE 7
  • 8. Array & Linked List Department of CSE 8 [0] [1] [2] A B CArray linked A B CLinked list Linked lists are unbounded (maximum number of items limited only by memory) node
  • 9. Stack  Stack ◦ New nodes can be added and removed only at the top ◦ Similar to a pile of dishes ◦ Last-in, first-out (LIFO)  push ◦ Adds a new node to the top of the stack  pop ◦ Removes a node from the top Department of CSE 9
  • 10. Stack  A stack is a list in which insertion and deletion take place at the same end ◦ This end is called top ◦ The other end is called bottom. Department of CSE 10
  • 11. Queue  Queue ◦ Similar to a supermarket checkout line ◦ First-in, first-out (FIFO) ◦ Nodes are removed only from the head ◦ Nodes are inserted only at the tail  Insert and remove operations ◦ Enqueue (insert) and dequeue (remove) Department of CSE 11
  • 12. The Queue Operations  A queue is like a line of people waiting for a bank teller. The queue has a front and a rear. Department of CSE 12 $ $ Front(Removal)Rear(insertion) Walking out
  • 13. Tree A tree T is a finite non empty set of elements. One of these elements is called the root, and the remaining elements, if any, are portioned into trees, which are called the sub trees of T. Department of CSE 13
  • 15. Graph  A graph is defined as: “Graph G is a ordered set (V,E), where V(G) represent the set of elements, called vertices, and E(G) represents the edges between these vertices.”  Graphs can be ◦ Undirected ◦ Directed Department of CSE 15
  • 16. Graph Figure shows a sample graph V(G)={v1,v2,v3,v4,v5} E(G)={e1,e2,e3,e4,e5} Department of CSE 16 v1 v5 v4 v2 v3 e2 e1 e5 e4 e3 Fig . (a) Undirected Graph
  • 17. Graph Department of CSE 17 v1 v5 v4 v2 v3 e2 e1 e5 e4 e3 Fig. (b) Directed Graph In directed graph, an edge is represented by an ordered pair (u,v) (i.e.=(u,v)), that can be traversed only from u toward v.
  • 18. Data Structure Operations Five major operations are associated with all data structures. i. Creation:- Initialization of the beginning. ii. Insertion: - Insertion means adding new details or new node into the data structure. iii. Deletion: - Deletion means removing a node from the data structure. iv. Traversal: - Traversing means accessing each node exactly once so that the nodes of a data structure can be processed. Traversing is also called as visiting. v. Searching: - Searching means finding the location of node for a given key value. Department of CSE 18
  • 19. Data Structure Operations(contd..)  Apart from the four operations mentioned above, there are two more operations occasionally performed on data structures. They are: (a) Sorting: -Sorting means arranging the data in a particular order. (b) Merging: - Merging means joining two lists. Department of CSE 19
  • 20. A first look on ADTs  Solving a problem involves processing data, and an important part of the solution is the efficient organization of the data  In order to do that, we need to identify: 1. The collection of data items 2. Basic operation that must be performed on them
  • 21. Abstract Data Type (ADT)  The word “abstract” refers to the fact that the data and the basic operations defined on it are being studied independently of how they are implemented  We think about what can be done with the data, not how it is done
  • 22. Primitive Data Type vs ADT Department of CSE 22
  • 23. Some ADT’s Some user defined ADT’s are  Stacks  Queues Department of CSE 23
  • 24. Stack ADT We define a stack as an ADT as shown below: Department of CSE 24
  • 25. Queue ADT We define a queue as an ADT as shown below: Department of CSE 25