DATA STRUCTURE AND

ALGORITHM
Represent by Trum Anivia
Contents

• Abstract data type

• Stack
• Queue
• Sorting algorithms
What is ADT ?
• An ADT is an
extensive data type
that is expressed
externally
• An ADT will cover all
data and summarize
the main ideas to
the surface in the
most
understandable way
 STACK
• Stack data
structures can
only save and
retrieve data
from one end
• STACK obeys the
law of Last-In /
First-Out
 QUEUE
• Unlike the stack data
structure, the queue
data structure has
two different data
storage and storage
heads
•
Queue data structure
follows the method:
First-In / First-Out
 Sorting Algorithms(Hashing Function)
• Like OTP
• The hash function
receives an input,
from that input
produces a
corresponding
output value.
• The input value can
be of arbitrary
length, but the hash
value is always 64
characters long
 Sorting Algorithms(search algorithm)
• Search algorithms are
quite popular because
of their usefulness and
convenience
• A data warehouse can
be very large, so quick
searches are always a
top concern. To be able
to use the data
algorithm must be
arranged in a sequence
Sorting Algorithms(search algorithm)