Scribd
Upload
6 views

Data Structure Presentation

Uploaded by

vijayavijju1047
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
6 views

Data Structure Presentation

Uploaded by

vijayavijju1047
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 18

INTRODUCTION

TO
DATA STRUCTURE
Presented By :G.Mounika
College Name: Bhaskar Engineering
college
Branch : CSC ( First year)
R-NO :22GE1A0527
CONTENTS

 DEFINATION OF DATA STRUCTURES


 DATA STRUCTURE OPERATIONS
 TYPES OF DATA STRUCTURE
 LINEAR DATA STRUCTURE
 NON-LINEAR DATA STRUCTURE
 DIFFERENCE BETWEEN LINEAR AND NON-LINEAR DATA
STRUCTURE
DEFINATION OF DATA
STRUCTURE
 It is a logical way of storing data and it also define
mechanism of retrieve data.
 Data structure is representation of the logical relationship
existing between individual elements of data
 In other words, a data structure is a way of organizing all
data items that considers not only the elements stored but
also their relationship to each other.
 Knowledge about data structures help to understand the
working of each data structure and it helps to write memory
and efficient code.
DATA STRUCTURE OPERATIONS

 Traversing : Accessing each record exactly once so that


cartain item in the record may be processed.
 Searching : Finding the location of the record with a
given key value.
 Insertion : Adding a new record to the structure.
 Delation : Removing a record from the structure.
TYPES OF DATA STRUCTURE
LINEAR DATA STRUCTURE

 ARRAY
 LINKED LIST
 STACK
 QUEUE
ARRAY

 An array is a collection of homogeneous type


of data elements .
 An array is consisting of a collection of
elements.
 Array can always be read or written through
loop.
OPERATIONS PERFORMED ON
AN ARRAY
 Traversing
 Searching
 Insertion
 Delation
 Sorting
LINKED LIST

A linked list is a linear collection of data


elements.It has two parts one is info and
other is link part is address of next
node.
OPERATIONS PERFORMED ON
LINKED LIST

 Traversing
 Searching
 Insertion
 Delation
STACK
 A stack also called last in first out(LIFO) system .
 A stack is a list of elements in which an element may be
inserted or delayed at one end which is known as TOP
of the stack.

OPERATIONS PERFORMED ON STACK


 PUSH : Add an element in stack.
 POP : Remove an element in stack.
QUEUE
 A queue also called first in first out (FIFO) system.
 A queue is a linear list of elements in which insertion
can be done at one end which is known as front and
delation can be done which is known as rear.

OPERATIONS PERFORMED ON QUEUE


 INSERTION : Add a new element in queue.
 Delation : Removing an element in queue.
NON- LINEAR DATA STRUCTURE

Non linear data structures are can be classified as 2 types


1-TREE : Data frequently contain a hierarchical relationship between
various elements.The data structure which reflects this relationship is
called tree.

OPERATIONS PERFORMED ON TREE


 INSERTION
 DELATION
 SEARCHING
TREEE REPRESENTATION
GRAPH
 Data sometimes contain a relationship between pairs
of elements which is not necessarily hierarchical in
nature.
 For example , an airline files only between cities
connected by lines

OPERATIONS PERFORMED ON GRAPH


 SEARCHING
 INSERTION
 DELATION
GRAPH REPRESETION
LINEAR Vs NON-LINEAR DATA
STRUCTURES
LINEAR DATA NON-LINEAR DATA
STRUCTURE STRUCTURE
 The data items are  The data items are
arranged in sequential arranged in non-sequential
order ,one after the other . order.
 All the items are present  The data items are present
on the order. at different layers.
 The time complexity  Time complexity remains
increase with the data size . the same.
 Example :  Example : Tree,Graph
Arrays,Stack,Queue.

You might also like