4. DATA STRUCTURE
OPERATIONS
Traversing: Accessing each record exactly once
so that certain 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
Deletion : removing a record from the structure
5. Types of data structure
TYPES OF
DATA
STRUCTURE
•NON-
LINEAR
•LINEAR
7. ARRAY
An array is a collection of
homogeneous type of data elements.
An array is consisting of a collection of
elements .
REPRESENTATION OF ARRAY IN MEMORY
1
2
3
4
5
10. LINKED LIST
A Linked list is a linear collection of
data elements .It has two part one is
info and other is link part.info part
gives information and link part is
address of next node.
13. stack (lifo)
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 deleted at
one end which is known as TOP of the
stack.
EEE TOP
DDD
CCC
BBB
AAA
16. queue (fifo)
A Queue also called first in first out (FIFO)
system.
A queue is a linear list of element in which
insertion can be done at one end which is
known as front and deletion can be done
which is known as rear.
3 2 1
20. TREE
Data frequently contain a hierarchical
relationship between various elements.
The data structure which reflects this
relationship is called tree.
23. graph
Data sometimes contain a relationship
between pairs of elements which is not
necessarily hierarchical in nature.
For example, an airline flies only between
cities connected by lines.