[go: up one dir, main page]
Scribd
Upload
7 views20 pages

Introduction To Data Structure

The document provides an introduction to data structures, defining them as organized ways to store and manage data efficiently. It discusses the importance of data structures in solving complex problems and classifies them into simple and compound structures, including linear and non-linear types. Various types of data structures such as arrays, stacks, queues, linked lists, trees, and graphs are explained, along with their operations and selection criteria.

Uploaded by

Farhana
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
7 views20 pages

Introduction To Data Structure

The document provides an introduction to data structures, defining them as organized ways to store and manage data efficiently. It discusses the importance of data structures in solving complex problems and classifies them into simple and compound structures, including linear and non-linear types. Various types of data structures such as arrays, stacks, queues, linked lists, trees, and graphs are explained, along with their operations and selection criteria.

Uploaded by

Farhana
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/ 20

Introduction to Data Structure

Basic Terminologies
●
Data Structure
– Data: are simply a value are set of values of
different type which is called data types like
string, integer, char etc.
– Structure: Way of organizing information, so that
it is easier to use
– In simple words we can define data structures as
●
Its a way organizing data in such a way so
that data can be easier to use.
Basic Terminologies

●
Data Structure ..
– A data structure is a particular way of
organizing data in a computer so that it
can be used effi ciently.
– A scheme for organizing related pieces of
information.
Why Data Structure

●
Human requirement with computer are going to
complex day by day. To solve the complex
requirements in efficient way we need this
study.
●
Provide fastest solution of human requirements.
●
Provide efficient solution of complex problem.
– Space
– Time
Study in Data Structure

●
Logical or mathematical description of the
structure.
●
Implementation of structure on a computer
using different computer languages ( C, C++,
JAVA, pl-languages etc.)
●
Qunatitative analysis of the structure, which
includes determining the amount of memory
needed to store the structure and the time
required to process the structure.
Classification of Data Structure
Data Structure

Simple Data Structure


Compound Data Structure

Integer Float Character Pointer

Linear Data Structure Non-Linear Data Structure

Array Linked List Stack Queue Tree Graph Files


Classification of Data Structure ...

Simple Data Structure: Simple data structure can be


●

constructed with the help of primitive data structure. A


primitive
primitivedata
datastructure
structureused
usedtotorepresent
represent
the the standard
standard datadata
types
types
of any
ofany
one
one
ofthe
of
thecomputer
computerlanguages
languages(integer,
(integer, Characte
Character,
float etc.).

Compound
Compound
●
DataStructure:
Data Structure:
Compound data
Compound structure
data structure
can
canbebeconstructed
constructedwith withthe
thehelp
helpofofany
anyone
one ofofprimitive
the the primitive
datada
structure
structure
and
and
it is
ithaving
having
is a aspecific
specificfunctionality.
functionality.
canItbe
It can be
designed by user.
It can It be classified as Linear and Non-Linear
Data Structure.
.
Classification of Data Structure ...

●
Linear Data Structures: A linear data structure traverses
the data elements sequentially, in which only one data element
can directly be reached. Ex: Arrays, Linked Lists
●
Non-Linear Data Structures: Every data item is
attached to several other data items in a way that is specific for
reflecting relationships. The data items are not arranged in a
sequential structure. Ex: Trees, Graphs
Operation on Linear/Non-Linear
Data Structure
●
Add an element
Delete an element
●

●
Traverse / Display
Sort
●
the list of elements
Search
●
for a data element
Types of Data Structure
●
Array: is commonly used in computer
programming to mean a contiguous block of
memory locations, where each memory location
stores one fixed-length data item. e.g. Array of
Integers int a[10], Array of Character char b[10

Array of Integers Array of Character


0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9
5 6 4 3 7 8 9 2 1 2 5 6 4 3 7 8 9 2 1 2
Types of Data Structure ...
Stack: A stack is a data
structure in which items can
be inserted only from one
end and get items back from
the same end. There , the last
item inserted into stack, is
the the first item to be taken
out from the stack. In short
its also called Last in First
out [LIFO].
Types of Data Structure ...
Queue: A queue is two
ended data structure in
which items can be
inserted from one end and
taken out from the other
end. Therefore , the first
item inserted into queue is
the first item to be taken
out from the queue. This
property is called First in
First out [FIFO].
Types of Data Structure ...
Linked List: Could alternately used to store items. In
linked list space to store items is created as is needed
and destroyed when space no longer required to store
items. Hence linked list is a dynamic data structure
space acquire only when need.
Types of Data Structure ...

Tree: is a non-linear data Binary Tree: A binary


structure which is tree is a tree such that
mainly used to represent every node has at most 2
data containing a child and each node is
hierarchical relationship labeled as either left of
between elements. right child.
Types of Data Structure ...
Types of Data Structure ...

Graph: It is a set of items connected by edges.


Each item is called a vertex or node. Trees are
just like a special kinds of graphs. Graphs are
usually represented by G = (V, E), where V is the
set vertices and E is the set of Edges.
Types of Data Structure ...

Undirected Graph: A graph


whose edges are
unordered pair of vertices.
That is each edge connects
two vertices. In an
undirected graph, direction
is not important, if the path
is available, it can be
traversed in any direction.
Types of Data Structure ...

Directed Graph: In directed graph a directional


edge connect two node/vertex. If there is one edge
from one vertex to other then only this path can be
followed.
Types of Data Structure ...

Weighted Graph: A graph having a weight, or number


associated with each edge
Selecting a Data Structure

●
Analyze the problem to determine the resource
constraints a solution must meet.
●
Determine the basic operations that must be
supported. Quantify the resource constraints
for each operation.
●
Select the data structure that best meets these
requirements.

You might also like