0% found this document useful (0 votes)
20 views

data structure ppt

Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
20 views

data structure ppt

Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

INTRODUCTION TO DATA

STRUCTURE
WHY WE NEED DATA
STRUCTURE?
data structure help to orgnize
data in a way that makes it easir
for computers to prcess and for
humans to understand.it help to
access data eaisily.
What are Data Structures?
Data structures are specialized formats for
organizing and storing data. They enable efficient
data access and modification. Understanding data
structures is vital for optimizing algorithms and
improving performance in software development. It
is efficient way to use data.
Types of Data Structures
There are two main categories of
data structures: linear and non-
linear.linear structures include
arrangement of data linealy this
data type include
array,linkedlist,stack and queue,
while non-linear structures stores
data non linear such as hierarchy
this data type include trees and
graph . Each type has its unique
advantages and applications.
Arrays: The Basics
An array is a collection of elements identified
by index or key. They are simple and efficient for
storing data of the same type. Arrays allow for
constant time access to elements, making
them ideal for many applications.
Linked Lists Explained
A linked list is a linear collection
of data elements, where each
element points to the next.
Unlike arrays, linked lists allow
for dynamic memory allocation
and efficient insertions and
deletions, making them
versatile for various
applications.
stack
stack is a linear data structure
which is represente static and
dynamic both way. stack have
only one end which is use for
insertion and deletion both
operation which is said as topof
the stack.
Queue
queue is a another type linear data stucture which
is used to stored data linearly.it can be
represented using array and linked list. queue has
two end rare and front which is used for insertion
and deletion.from rare element will be insert and
from thr front element will be deleted.
Trees: Hierarchical
Structures

A tree is a hierarchical data


structure that resembles a
family tree. It consists of nodes
connected by edges, with a
single root node. Trees are
excellent for representing
relationships and are widely
used in databases and file
systems.
Graphs
graph data structure is a
collection of nodes by
edges.it'sused to represent
relationship between differnt
entities.formally graph is
compoesed of a setof
vertices(v)and a set of edges(E)
the graph is denoted by (V,E).
Conclusion: The Power of Data
structure
Understanding and utilizing data structures is
essential for any programmer. They not only
enhance efficiency but also simplify complex
problems. By mastering these structures, you
unlock the potential for innovative and effective
software solutions.
Thanks!
your's
Nandini Gaikwad....
[email protected]

You might also like