DATA STRUCTURE AND

ALGORITHMS
PRESENTATION ON DATA
STRUCTURE

Presented By:
Fahad Safeer
2k18-ELE-110
INTRODUCTION TO DATA
STRUCTURE
• Data Structure is a way of collecting and organising data
in such a way that we can perform operations on these
data in an effective way.
 FUNDAMENTAL DATA
STRUCTURE

Linear Data Structure

Non Linear Data Structure

 Difference
• Linear Data Structure • Non Linear Data Structure
Elements stored in Elements are not stored in the
sequence manner. sequence manner.
Types: Types:
 Arrays Tree
 Stack Graph
 Queue Table
 Linked List Sets
 Arrays

Consisting of a collection of elements, each identified

by at least one array index or key.
 Stacks
It is an ordered list of similar data type. Stack is a
LIFO(Last in First out) structure or we can say FILO(First
in Last out).
 Queue

One end is always used to insert data and the other is

used to remove data. Queue follows First-In-First-Out
methodology.
 Linked List

Each element (we will call it a node) of a list is

comprising of two items , the data and a reference to
the next node.
 Tree

A hierarchical tree structure, with a root value and subtrees

of children with a parent node, represented as a set of
linked nodes.
 Graph

A graph is a pictorial representation of a set of

objects where some pairs of objects are connected
by links.